A hierarchy of maximal intersecting triple systems

DOI10.7494/OPMATH.2017.37.4.597MaRDI QIDQ4690989zbMATH OpenFDO

Authors Joanna Polcyn, Andrzej Ruciński

Publication date 23 October 2018

Published in Opuscula Mathematica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1608.06114

zbMATH Keywords

3-uniform hypergraphmaximal intersecting familytriple system

Mathematics Subject Classification ID

Triple systems (05B07) Hypergraphs (05C65) Extremal set theory (05D05)

Abstract: We reach beyond the celebrated theorems of ErdH{o}s-Ko-Rado and Hilton-Milner, and, a recent theorem of Han-Kohayakawa, and determine all maximal intersecting triples systems. It turns out that for each $nge7$ there are exactly 15 pairwise non-isomorphic such systems (and 13 for $n=6$). We present our result in terms of a hierarchy of Tur'an numbers $e{x}^{(s)}(n,M_2^3)$, $sge1$, where $M_2^3$ is a pair of disjoint triples. Moreover, owing to our unified approach, we provide short proofs of the above mentioned results (for triple systems only). The triangle $C_3$ is defined as $C_3=x_1,y_3,x_2,x_1,y_2,x_3,x_2,y_1,x_3$. Along the way we show that the largest intersecting triple system $H$ on $nge6$ vertices, which is not a star and is triangle-free, consists of $max10,n$ triples. This facilitates our main proof's philosophy which is to assume that $H$ contains a copy of the triangle and analyze how the remaining edges of $H$ intersect that copy.

Recommendations

• scientific article; zbMATH DE number 933175
• Intersections of simple threefold directed triple systems
• Intersection numbers of Kirkman triple systems
• scientific article; zbMATH DE number 871169
• The intersection numbers of nearly Kirkman triple systems
• Maximal intersecting families
• scientific article; zbMATH DE number 1895063
• Intersections of Kirkman triple systems
• scientific article; zbMATH DE number 5181089
• The 3-way intersection problem for Kirkman triple systems

Cites work

• A homological approach to two problems on finite sets
• Critical hypergraphs and interesting set-pair systems
• Exact solution of some Turán-type problems
• scientific article; zbMATH DE number 3204639 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
• Non-trivial intersecting families
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
• The structure of large intersecting families
• Transversals and matchings in 3-uniform hypergraphs

Cited in

(9)

• A note on maximal hierarchies
• A degree version of the Hilton-Milner theorem
• Stability on matchings in 3-uniform hypergraphs
• scientific article; zbMATH DE number 644325 (Why is no real title available?)
• On the multicolor Ramsey number for 3-paths of length three
• One more Turán number and Ramsey number for the loose 3-uniform path of length three
• Turán and Ramsey numbers for 3‐uniform minimal paths of length 4
• On Multicolor Ramsey Numbers of Triple System Paths of Length 3
• Some exact and asymptotic results for hypergraph Turán problems in _2-norm

This page was built for publication: A hierarchy of maximal intersecting triple systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4690989)