Author:
Casselgren Carl Johan,Johansson Per,Markström Klas
Abstract
AbstractWe consider the problem of extending and avoiding partial edge colorings of hypercubes; that is, given a partial edge coloring $$\varphi $$
φ
of the d-dimensional hypercube $$Q_d$$
Q
d
, we are interested in whether there is a proper d-edge coloring of $$Q_d$$
Q
d
that agrees with the coloring $$\varphi $$
φ
on every edge that is colored under $$\varphi $$
φ
; or, similarly, if there is a proper d-edge coloring that disagrees with $$\varphi $$
φ
on every edge that is colored under $$\varphi $$
φ
. In particular, we prove that for any $$d\ge 1$$
d
≥
1
, if $$\varphi $$
φ
is a partial d-edge coloring of $$Q_d$$
Q
d
, then $$\varphi $$
φ
is avoidable if every color appears on at most d/8 edges and the coloring satisfies a relatively mild structural condition, or $$\varphi $$
φ
is proper and every color appears on at most $$d-2$$
d
-
2
edges. We also show that $$\varphi $$
φ
is avoidable if d is divisible by 3 and every color class of $$\varphi $$
φ
is an induced matching. Moreover, for all $$1 \le k \le d$$
1
≤
k
≤
d
, we characterize for which configurations consisting of a partial coloring $$\varphi $$
φ
of $$d-k$$
d
-
k
edges and a partial coloring $$\psi $$
ψ
of k edges, there is an extension of $$\varphi $$
φ
that avoids $$\psi $$
ψ
.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference25 articles.
1. Andersen, L.D., Hilton, A.J.W.: Thank Evans! Proc. Lond. Math. Soc. 47, 507–522 (1983)
2. Andrén, L.J., On Latin squares and avoidable arrays. Doctoral thesis, Umeå University (2010)
3. Andrén, L.J., Casselgren, C.J., Markström, K.: Restricted completion of sparse Latin squares. Comb. Probab. Comput. 28, 675–695 (2019)
4. Andrén, L.J., Casselgren, C.J., Öhman, L.-D.: Avoiding arrays of odd order by Latin squares. Comb. Probab. Comput. 22, 184–212 (2013)
5. Casselgren, C.J.: On avoiding some families of arrays. Discr. Math. 312, 963–972 (2012)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Brooks' theorem with forbidden colors;Journal of Graph Theory;2023-10-11
2. Edge precoloring extension of trees II;Discussiones Mathematicae Graph Theory;2022