On even-cycle-free subgraphs of the hypercube

DOI10.1016/j.jcta.2011.02.009zbMath1277.05091OpenAlexW1980491045MaRDI QIDQ5892562

Lale Özkahya, Zoltan Fueredi

Publication date: 17 June 2011

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

Full work available at URL: https://doi.org/10.1016/j.jcta.2011.02.009

zbMATH Keywords

hypercubecycleTurán problem

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (9)

Vertex Turán problems for the oriented hypercube ⋮ Extremal numbers for cycles in a hypercube ⋮ Saturation in the Hypercube and Bootstrap Percolation ⋮ On crown-free families of subsets ⋮ On a covering problem in the hypercube ⋮ On even-cycle-free subgraphs of the doubled Johnson graphs ⋮ Extremal even-cycle-free subgraphs of the complete transposition graphs ⋮ The vertex Turán density in 3-ary \(n\)-cubes ⋮ Generalized Turán densities in the hypercube

Cites Work

• Unnamed Item
• Unnamed Item
• An extremal theorem in the hypercube
• Bounding the size of square-free subgraphs of the hypercube
• A note on short cycles in a hypercube
• Hexagon-free subgraphs of hypercubes
• A Ramsey-type result for the hypercube
• On 14-Cycle-Free Subgraphs 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

This page was built for publication: On even-cycle-free subgraphs of the hypercube