Three-graphs without two triples whose symmetric difference is contained in a third
Abstract
Katona conjectured that if a three-graph has 3n vertices and n3+1 triples, then there are two triples whose symmetric difference is contained in a third triple. This conjecture can be considered as a natural generalization of Turán's theorem [4] for edge graphs. The aim of this note is to prove this conjecture. © 1974.
Publication Title
Discrete Mathematics
Recommended Citation
Bollobás, B. (1974). Three-graphs without two triples whose symmetric difference is contained in a third. Discrete Mathematics, 8 (1), 21-24. https://doi.org/10.1016/0012-365X(74)90105-8
COinS
