Turán’s Theorem in the Hypercube
From MaRDI portal
Publication:5454262
DOI10.1137/060649422zbMath1140.05036OpenAlexW2086039438MaRDI QIDQ5454262
Noga Alon, Anja Krech, Tibor Szabó
Publication date: 28 March 2008
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060649422
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (26)
Rainbow copies of \(C_4\) in edge-colored hypercubes ⋮ Polychromatic colorings of 1-regular and 2-regular subgraphs of complete graphs ⋮ Rainbow generalizations of Ramsey theory: A survey ⋮ Vertex Turán problems for the oriented hypercube ⋮ Linear \(d\)-polychromatic \(Q_{d-1}\)-colorings of the hypercube ⋮ Extremal numbers for cycles in a hypercube ⋮ Linear polychromatic colorings of hypercube faces ⋮ Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets ⋮ Inducibility in the hypercube ⋮ Saturated Subgraphs of the Hypercube ⋮ Coloring the cube with rainbow cycles ⋮ The \(Q_2\)-free process in the hypercube ⋮ 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 ⋮ Extremal even-cycle-free subgraphs of the complete transposition graphs ⋮ Clumsy packings of graphs ⋮ Vertex Turán problems in the hypercube ⋮ Polychromatic Colorings on the Integers ⋮ Exact hyperplane covers for subsets of the hypercube ⋮ The vertex Turán density in 3-ary \(n\)-cubes ⋮ Some Turán type results on the hypercube ⋮ Hypercube 1-factorizations from extended Hamming codes ⋮ Generalized Turán densities in the hypercube ⋮ The polychromatic number of small subsets of the integers modulo \(n\)
This page was built for publication: Turán’s Theorem in the Hypercube
