Daisies and Other Turán Problems

DOI10.1017/S0963548311000319zbMath1293.05381arXiv1105.1553MaRDI QIDQ3103623

Imre Leader, Claudia Malvenuto, Béla Bollobás

Publication date: 8 December 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

extremal densities of daisy-free families

Mathematics Subject Classification ID

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

Related Items (7)

On the codegree density of complete 3-graphs and related problems ⋮ Lower bounds for the Turán densities of daisies ⋮ On a covering problem in the hypercube ⋮ Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs ⋮ Set families with a forbidden pattern ⋮ Extractors for small zero-fixing sources ⋮ On the algebraic and topological structure of the set of Turán densities

Cites Work

• Largest induced subgraphs of the n-cube that contain no 4-cycles
• Vertex Turán problems in the hypercube
• What we know and what we do not know about Turán numbers
• Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon

This page was built for publication: Daisies and Other Turán Problems