Some Turán type results on the hypercube

DOI10.1016/j.disc.2008.07.025zbMath1229.05151OpenAlexW2036610450MaRDI QIDQ1043648

David Offner

Publication date: 9 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.025

zbMATH Keywords

hypercuberobustnessFibonacci cubesupersaturationTurán type problem

Mathematics Subject Classification ID

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

Related Items

Enumerative properties and cube polynomials of Tribonacci cubes, Extremal numbers for cycles in a hypercube, Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets, Generalized Fibonacci cubes, On a covering problem in the hypercube, Clumsy packings of graphs, Vertex Turán problems in the hypercube, The degree sequence of Fibonacci and Lucas cubes, Polychromatic Colorings on the Integers, The vertex Turán density in 3-ary \(n\)-cubes, Generalized Turán densities in the hypercube

Cites Work

• Largest induced subgraphs of the n-cube that contain no 4-cycles
• Supersaturated graphs and hypergraphs
• Bounding the size of square-free subgraphs of the hypercube
• Subcube fault-tolerance in hypercubes
• Recursive fault-tolerance of Fibonacci cube in hypercubes
• A note on short cycles in a hypercube
• Hexagon-free subgraphs of hypercubes
• A Ramsey-type result for the hypercube
• Polychromatic Colorings of Subcubes of the Hypercube
• Subgraphs of a hypercube containing no small even cycles
• On the maximum number of edges in a c₄‐free subgraph of q_n
• Turán’s Theorem in the Hypercube
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item