On the density of 2-colorable 3-graphs in which any four points span at most two edges

DOI10.1002/jcd.20223zbMath1222.05139OpenAlexW2166471545MaRDI QIDQ3576967

Klas Markström, John Talbot

Publication date: 3 August 2010

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20223

zbMATH Keywords

hypergraphcovering designextremal problemdouble covering design

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)

Related Items (1)

On Turán densities of small triple graphs

Uses Software

• GLPK

Cites Work

• An exact result for 3-graphs
• Extremal problems whose solutions are the blowups of the small Witt- designs
• On hypergraphs with every four points spanning at most two triples

This page was built for publication: On the density of 2-colorable 3-graphs in which any four points span at most two edges