On hypergraphs with every four points spanning at most two triples

zbMath1023.05105MaRDI QIDQ1408551

Dhruv Mubayi

Publication date: 24 September 2003

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/122970

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (9)

On set systems with a threshold property ⋮ Constructions and bounds for \((m,t)\)-splitting systems ⋮ Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ The Codegree Threshold for 3-Graphs with Independent Neighborhoods ⋮ The codegree threshold of \(K_4^-\) ⋮ On Turán densities of small triple graphs ⋮ Turán problems on non-uniform hypergraphs ⋮ Chromatic Turán problems and a new upper bound for the Turán density of \(\mathcal K^{-}_{4}\) ⋮ On the density of 2-colorable 3-graphs in which any four points span at most two edges

This page was built for publication: On hypergraphs with every four points spanning at most two triples