On a covering problem in the hypercube

DOI10.1007/S00373-013-1379-8zbMath1306.05071arXiv1110.0224OpenAlexW2098910136MaRDI QIDQ489361

Brendon Stanton, Lale Özkahya

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypercubepolychromatic coloringcover number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Linear \(d\)-polychromatic \(Q_{d-1}\)-colorings of the hypercube ⋮ Linear polychromatic colorings of hypercube faces ⋮ Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets ⋮ Polychromatic Colorings on the Integers

Cites Work

• Unnamed Item
• Unnamed Item
• Vertex Turán problems in the hypercube
• An extremal theorem in the hypercube
• Bounding the size of square-free subgraphs of the hypercube
• Some Turán type results on the hypercube
• On a packing and covering problem
• Subcube fault-tolerance in hypercubes
• On crown-free families of subsets
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Daisies and Other Turán Problems
• 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
• Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs
• Turán’s Theorem in the Hypercube
• On even-cycle-free subgraphs of the hypercube

This page was built for publication: On a covering problem in the hypercube