On 14-Cycle-Free Subgraphs of the Hypercube

DOI10.1017/S0963548309009985MaRDI QIDQ3552500zbMATH OpenOpenAlexFDO

Authors Lale Özkahya, Zoltán Füredi

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)

Cites work

• A Ramsey-type result for the hypercube
• A note on short cycles in a hypercube
• Bounding the size of square-free subgraphs of the hypercube
• Cycles of even length in graphs
• Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon
• Hexagon-free subgraphs of hypercubes
• Largest induced subgraphs of the n-cube that contain no 4-cycles
• On the maximum number of edges in a c₄‐free subgraph of q_n
• Polychromatic Colorings of Subcubes of the Hypercube
• Subgraphs of a hypercube containing no small even cycles

Cited in

(11)

• On crown-free families of subsets
• On even-cycle-free subgraphs of the hypercube
• Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko
• Saturation in the hypercube and bootstrap percolation
• Maximum density of vertex-induced perfect cycles and paths in the hypercube
• On even-cycle-free subgraphs of the hypercube
• Inducibility in the hypercube
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Vertex Turán problems for the oriented hypercube
• scientific article; zbMATH DE number 5139441 (Why is no real title available?)
• Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3552500)