{"id":"hexagon/2611.00563","pdf":"https://hexagonmath.org/pdf/2611.00563v1","url":"https://hexagonmath.org/abs/2611.00563v1","tags":["math.LO","msc:05C65","msc:05C15","msc:03E05","msc:06A07","Erdős problems","canonical decomposition","hypergraph blocks","obligatory triple systems","partition lattices"],"score":0,"title":"Obligatory triple systems: atoms, spectra and decompositions","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Samuil Petkov"],"reviews":0,"subject":"math.CO","summary":"Erdős Problem 593 asks which finite triple systems embed in every triple system of uncountable chromatic number. Such finite systems are called obligatory. We describe their structure and the ways of decomposing them while keeping their original hyperedges. Every obligatory system without isolated points has canonical pieces, called atoms: single triples and expansions of finite $2$-connected bipartite graphs, obtained by adding one new private point to each graph edge. A forest records how the atoms meet and reconstructs the system. We determine exactly which numbers of vertices, hyperedges…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["ChatGPT","Codex","Aristotle"],"discussed":0,"published":"2026-11-18","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"all"}