Set Systems with No Singleton Intersection

DOI10.1137/050647372zbMath1129.05053OpenAlexW1993802470MaRDI QIDQ5426888

Peter Keevash, Richard M. Wilson, Dhruv Mubayi

Publication date: 16 November 2007

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:KEEsiamjd06

zbMATH Keywords

extremal set theoryrestricted intersections

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (15)

Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three ⋮ Approximation by juntas in the symmetric group, and forbidden intersection problems ⋮ Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths ⋮ Extremal Problems for Hypergraph Blowups of Trees ⋮ Integer sequences without singleton intersection ⋮ \(k\)-centric Turán numbers and multi-color Ramsey numbers for a loose 3-uniform path of length 3 ⋮ Turán problems and shadows. I: Paths and cycles ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ Linear trees in uniform hypergraphs ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ On set systems with restricted intersections modulo \(p\) and \(p\)-ary \(t\)-designs ⋮ Paths in Hypergraphs: A Rescaling Phenomenon ⋮ Hypergraph Turán numbers of vertex disjoint cycles

This page was built for publication: Set Systems with No Singleton Intersection