Avoiding and extending partial edge colorings of hypercubes
Carl Johan Casselgren, Per Johansson, Klas Markstr\"om

TL;DR
This paper investigates conditions under which partial edge colorings of hypercubes can be extended to full proper colorings that either agree or disagree with the partial coloring, providing new bounds and characterizations.
Contribution
It establishes new sufficient conditions for avoiding partial colorings of hypercubes and characterizes extension possibilities for mixed partial colorings involving multiple edges.
Findings
Avoidability when each color appears on at most d/8 edges under mild conditions
Extension results for color classes that are induced matchings when d is divisible by 3
Complete characterization of extension possibilities for configurations with partial colorings of d-k and k edges
Abstract
We consider the problem of extending and avoiding partial edge colorings of hypercubes; that is, given a partial edge coloring of the -dimensional hypercube , we are interested in whether there is a proper -edge coloring of that agrees with the coloring on every edge that is colored under ; or, similarly, if there is a proper -edge coloring that disagrees with on every edge that is colored under . In particular, we prove that for any , if is a partial -edge coloring of , then is avoidable if every color appears on at most edges and the coloring satisfies a relatively mild structural condition, or is proper and every color appears on at most edges. We also show that the same conclusion holds if is divisible by and every color class of is an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems
