Polychromatic Colorings on the Hypercube

Date
2018-01-01
Authors
Goldwasser, John
Lidicky, Bernard
Lidicky, Bernard
Martin, Ryan
Offner, David
Talbot, John
Young, Michael
Journal Title
Journal ISSN
Volume Title
Publisher
Source URI
Altmetrics
Authors
Research Projects
Organizational Units
Mathematics
Organizational Unit
Journal Issue
Series
Abstract

Given a subgraph G of the hypercube Qn, a coloring of the edges of Qn such that every embedding of G contains an edge of every color is called a G-polychromatic coloring. The maximum number of colors with which it is possible to G-polychromatically color the edges of any hypercube is called the polychromatic number of G. To determine polychromatic numbers, it is only necessary to consider a specific type of coloring, which we call simple. The main tool for finding upper bounds on polychromatic numbers is to translate the question of polychromatically coloring the hypercube so every embedding of a graph G contains every color into a question of coloring the 2-dimensional grid so that every so-called shape sequence corresponding to G contains every color. After surveying the tools for finding polychromatic numbers, we apply these techniques to find polychromatic numbers of a class of graphs called punctured hypercubes. We also consider the problem of finding polychromatic numbers in the setting where larger subcubes of the hypercube are colored. We exhibit two new constructions which show that this problem is not a straightforward generalization of the edge coloring problem.

Description
<p>Thisi is a manuscript made available through arxiv: <a href="https://arxiv.org/abs/1603.05865" target="_blank">https://arxiv.org/abs/1603.05865</a>.</p>
Keywords
polychromatic coloring, hypercube, coloring, Turan
Citation
Collections