On 14-Cycle-Free Subgraphs of the Hypercube

DOI10.1017/S0963548309009985zbMath1194.05058OpenAlexW2154501488MaRDI QIDQ3552500

Lale Özkahya, Zoltan Fueredi

Publication date: 22 April 2010

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

Full work available at URL: https://doi.org/10.1017/s0963548309009985

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (9)

Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko ⋮ Vertex Turán problems for the oriented hypercube ⋮ Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets ⋮ Inducibility in the hypercube ⋮ Saturation in the Hypercube and Bootstrap Percolation ⋮ On even-cycle-free subgraphs of the hypercube ⋮ On crown-free families of subsets ⋮ Maximum density of vertex-induced perfect cycles and paths in the hypercube ⋮ Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube

Cites Work

• Largest induced subgraphs of the n-cube that contain no 4-cycles
• Bounding the size of square-free subgraphs of the hypercube
• Cycles of even length in graphs
• A note on short cycles in a hypercube
• Hexagon-free subgraphs of hypercubes
• A Ramsey-type result for the hypercube
• Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon
• 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

This page was built for publication: On 14-Cycle-Free Subgraphs of the Hypercube