An extremal theorem in the hypercube

zbMath1193.05094arXiv1005.0582MaRDI QIDQ986719

David Conlon

Publication date: 12 August 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.0582

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Extremal combinatorics (05D99)

Related Items (18)

Vertex Turán problems for the oriented hypercube ⋮ Extremal numbers for cycles in a hypercube ⋮ Uniform Turán density of cycles ⋮ Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets ⋮ Inducibility in the hypercube ⋮ Saturation in the Hypercube and Bootstrap Percolation ⋮ On even-cycle-free subgraphs of the hypercube ⋮ Turán problems on non-uniform hypergraphs ⋮ On crown-free families of subsets ⋮ On a covering problem in the hypercube ⋮ Maximum density of vertex-induced perfect cycles and paths in the hypercube ⋮ On even-cycle-free subgraphs of the doubled Johnson graphs ⋮ Relative Turán Problems for Uniform Hypergraphs ⋮ Extremal even-cycle-free subgraphs of the complete transposition graphs ⋮ Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube ⋮ Triangle-free subgraphs of hypergraphs ⋮ The vertex Turán density in 3-ary \(n\)-cubes ⋮ Generalized Turán densities in the hypercube

This page was built for publication: An extremal theorem in the hypercube