On even-cycle-free subgraphs of the hypercube

DOI10.1016/j.endm.2009.07.085zbMath1273.05183OpenAlexW2074545042MaRDI QIDQ5891227

Lale Özkahya, Zoltan Fueredi

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2009.07.085

zbMATH Keywords

hypercubegeneralized Turan problem

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (4)

Extremal numbers for cycles in a hypercube ⋮ Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets ⋮ Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube ⋮ Generalized Turán densities in the hypercube

Cites Work

• Unnamed Item
• Bounding the size of square-free subgraphs of the hypercube
• A note on short cycles in a hypercube
• Hexagon-free subgraphs of hypercubes
• 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 even-cycle-free subgraphs of the hypercube