Linear polychromatic colorings of hypercube faces

MaRDI QIDQ1691094zbMATH OpenFDO

Authors Evan Chen

Publication date 15 January 2018

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

Full work available at URL https://arxiv.org/abs/1609.01247, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p2

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

coloringhypercubepolychromatic

Mathematics Subject Classification ID

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

Abstract: A coloring of the $ell$-dimensional faces of $Q_n$ is called $d$-polychromatic if every embedded $Q_d$ has every color on at least one face. Denote by $p^{e}ll(d)$ the maximum number of colors such that any $Q_n$ can be colored in this way. We provide a new lower bound on $p^{e}ll(d)$ for $ell>1$.

Recommendations

• Linear \(d\)-polychromatic \(Q_{d-1}\)-colorings of the hypercube
• Polychromatic Colorings of Subcubes of the Hypercube
• Polychromatic colorings on the hypercube
• Turán’s Theorem in the Hypercube
• Size of components of a cube coloring

Cites work

• On a covering problem in the hypercube
• Polychromatic Colorings of Subcubes of the Hypercube
• Turán’s Theorem in the Hypercube

Cited in

(5)

• Polychromatic colorings on the hypercube
• Size of components of a cube coloring
• Linear \(d\)-polychromatic \(Q_{d-1}\)-colorings of the hypercube
• Polychromatic Colorings of Subcubes of the Hypercube
• Pairing strategies for the maker-breaker game on the hypercube with subcubes as winning sets

This page was built for publication: Linear polychromatic colorings of hypercube faces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1691094)