Concepedia

On 14-Cycle-Free Subgraphs of the Hypercube

Zoltán Füredi, Lale Özkahya

Combinatorics Probability Computing · 2009 · 24 citations · 11 references

DOI

Concepts

Abstract

It is shown that the size of a subgraph of Q n without a cycle of length 14 is of order o (| E ( Q n )|).

References

11

Cycles of even length in graphs

J. A. Bondy, Miklós Simonovits · Journal of Combinatorial Theory Series B · 1974 · 412 citations

, , +7

Subgraphs of a hypercube containing no small even cycles

Fan Chung · Journal of Graph Theory · 1992 · 58 citations

, , +14

Turán’s Theorem in the Hypercube

Noga Alon, Anja Krech, Tibor Szabó · SIAM Journal on Discrete Mathematics · 2007 · 57 citations

, , +12

Largest induced subgraphs of the n-cube that contain no 4-cycles

Karen Anne Johnson, R. C. Entringer · Journal of Combinatorial Theory Series B · 1989 · 51 citations

, , +7

Hexagon‐free subgraphs of hypercubes

Marston Conder · Journal of Graph Theory · 1993 · 41 citations

, , +9