On 14-Cycle-Free Subgraphs of the Hypercube
- 1 September 2009
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 18 (5) , 725-729
Abstract
It is shown that the size of a subgraph of Qn without a cycle of length 14 is of order o(|E(Qn)|).Keywords
This publication has 12 references indexed in Scilit:
- Bounding the size of square-free subgraphs of the hypercubeDiscrete Mathematics, 2009
- Graph Powers, Delsarte, Hoffman, Ramsey, and ShannonSIAM Journal on Discrete Mathematics, 2007
- A note on short cycles in a hypercubeDiscrete Mathematics, 2006
- A Ramsey-type result for the hypercubeJournal of Graph Theory, 2006
- On quadrilaterals in layers of the cube and extremal problems for directed and oriented graphsJournal of Graph Theory, 2000
- On the maximum number of edges in a c4‐free subgraph of qnJournal of Graph Theory, 1995
- Hexagon‐free subgraphs of hypercubesJournal of Graph Theory, 1993
- Subgraphs of a hypercube containing no small even cyclesJournal of Graph Theory, 1992
- Largest induced subgraphs of the n-cube that contain no 4-cyclesJournal of Combinatorial Theory, Series B, 1989
- Cycles of even length in graphsJournal of Combinatorial Theory, Series B, 1974