Vertex Turán problems in the hypercube

DOI10.1016/j.jcta.2009.07.004zbMath1230.05176arXiv0904.1479OpenAlexW2125510310MaRDI QIDQ965224

J. Robert Johnson, John Talbot

Publication date: 21 April 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

hypercubeextremal problemTurán problem

Mathematics Subject Classification ID

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

Related Items (9)

Vertex Turán problems for the oriented hypercube ⋮ Lower bounds for the Turán densities of daisies ⋮ Inducibility in the hypercube ⋮ The \(Q_2\)-free process in the hypercube ⋮ On a covering problem in the hypercube ⋮ Maximum density of vertex-induced perfect cycles and paths in the hypercube ⋮ Set families with a forbidden pattern ⋮ Daisies and Other Turán Problems ⋮ The vertex Turán density in 3-ary \(n\)-cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• Constructions of non-principal families in extremal hypergraph theory
• Bounding the size of square-free subgraphs of the hypercube
• Some Turán type results on the hypercube
• On induced subgraphs of the cube
• The Turán density of triple systems is not principal
• On extremal problems of graphs and generalized graphs
• A generalization of results of P. Erdős, G. Katona, and D. J. Kleitman concerning Sperner's theorem
• Families of \(k\)-independent sets
• Vector sets for exhaustive testing of logic circuits
• Subgraphs of a hypercube containing no small even cycles
• Turán’s Theorem in the Hypercube
• On the structure of linear graphs

This page was built for publication: Vertex Turán problems in the hypercube