On 14-Cycle-Free Subgraphs of the Hypercube
From MaRDI portal
Publication:3552500
DOI10.1017/S0963548309009985zbMATH Open1194.05058OpenAlexW2154501488MaRDI QIDQ3552500FDOQ3552500
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
Cites Work
- Cycles of even length in graphs
- Hexagon-free subgraphs of hypercubes
- A Ramsey-type result for the hypercube
- Largest induced subgraphs of the n-cube that contain no 4-cycles
- Bounding the size of square-free subgraphs of the hypercube
- Subgraphs of a hypercube containing no small even cycles
- On the maximum number of edges in a c4‐free subgraph of qn
- A note on short cycles in a hypercube
- Polychromatic Colorings of Subcubes of the Hypercube
- Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon
Cited In (11)
- On crown-free families of subsets
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
- Vertex Turán problems for the oriented hypercube
- Title not available (Why is that?)
- Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets
- Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko
- Saturation in the hypercube and bootstrap percolation
- Inducibility in the hypercube
- On even-cycle-free subgraphs of the hypercube
- On even-cycle-free subgraphs of the hypercube
- Maximum density of vertex-induced perfect cycles and paths in the hypercube
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)
