Extending edge-colorings of distance-2 matchings in the hypercube
Discrete Applied Mathematics · 2026-07 · 387 · 33-36
DOI: 10.1016/j.dam.2026.02.041 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Applied Mathematics, 2026-07. Verfasst von Pál Bärnkopf. Die Arbeit nennt 15 Literaturangaben. Gefördert von: Hungarian Academy of Sciences.
Abstract (Originalsprache)
Casselgren, Markst\"orm, and Pham conjectured that any precolored dis\-tan\-ce-2 matching in the $d$-dimensional cube $Q_d$ with at most $d$ colors can be extended to a proper $d$-edge-coloring. In this paper, we prove this conjecture and some related theorems. Especially, our result establishes that if $G$ is a bipartite graph, then a precolored distance-2 matching in the Cartesian product $H = G \mathbin{\Box} K_{2m}$ with at most $\chi'(H) = \Delta(H) = \Delta(G) + 2m - 1$ colors can be extended to an edge-coloring using at most $\chi'(H)$ colors. As another generalization, we establish a similar result for the Cartesian product $G \mathbin{\Box} K_{1,m}$.
Förderung
- Hungarian Academy of Sciences
Zitieren
APA
Bärnkopf, P. (2026). Extending edge-colorings of distance-2 matchings in the hypercube. Discrete Applied Mathematics, 387, 33-36. https://doi.org/10.1016/j.dam.2026.02.041
Vancouver
Bärnkopf P. Extending edge-colorings of distance-2 matchings in the hypercube. Discrete Applied Mathematics. 2026;387:33-36. doi:10.1016/j.dam.2026.02.041
BibTeX
@article{Brnkopf2026,
author = {Bärnkopf, Pál},
title = {Extending edge-colorings of distance-2 matchings in the hypercube},
journal = {Discrete Applied Mathematics},
year = {2026},
volume = {387},
pages = {33--36},
doi = {10.1016/j.dam.2026.02.041}
}
EUVIMED