A hierarchy of maximal intersecting triple systems

DOI10.7494/OpMath.2017.37.4.597zbMath1402.05209arXiv1608.06114MaRDI QIDQ4690989

Andrzej Ruciński, Joanna Polcyn

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

triple system3-uniform hypergraphmaximal intersecting family

Mathematics Subject Classification ID

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

Related Items (6)

Stability on matchings in 3-uniform hypergraphs ⋮ Turán and Ramsey numbers for 3‐uniform minimal paths of length 4 ⋮ A degree version of the Hilton-Milner theorem ⋮ On Multicolor Ramsey Numbers of Triple System Paths of Length 3 ⋮ 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

Cites Work

• Unnamed Item
• Transversals and matchings in 3-uniform hypergraphs
• Non-trivial intersecting families
• Critical hypergraphs and interesting set-pair systems
• Exact solution of some Turán-type problems
• A homological approach to two problems on finite sets
• Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
• 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
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

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