Metraipolis › archive › dc_ebeb7aef24c2
The List Edge-Coloring Conjecture for New Infinite Families — arXiv:2608.22895
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.22895
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T08:33:12.520Z
- SHA-256 of the archived text
4ca300cdcf39276f7fac65c75f63143f58f3ae765a0c79c27d0c1f08fe162fa3- Stable URL of this page
https://metraipolis.com/documento/dc_ebeb7aef24c2
How to cite
The List Edge-Coloring Conjecture for New Infinite Families — arXiv:2608.22895 — arXiv (en), https://arxiv.org/abs/2608.22895 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ebeb7aef24c2 (Metraipolis archive dc_ebeb7aef24c2, sha256 4ca300cdcf39276f7fac65c75f63143f58f3ae765a0c79c27d0c1f08fe162fa3)
BibTeX
@misc{dcebeb7aef24c2,
title = {The List Edge-Coloring Conjecture for New Infinite Families — arXiv:2608.22895},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.22895},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ebeb7aef24c2; sha256 4ca300cdcf39276f7fac65c75f63143f58f3ae765a0c79c27d0c1f08fe162fa3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.22895. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The List Edge-Coloring Conjecture predicts that any graph whose edges can be colored with $k$ colors can also be colored from arbitrary lists of $k$ colors. We prove its stronger online form for two new infinite families, $K_{p-1}$ and $K_{2p}$, where $p$ is an odd prime. For even $n$, order the vertices of $K_n$ and draw each perfect matching as arcs above them. Count crossings separately within each matching, and let $S_n$ be the number of decompositions into perfect matchings having an even total crossing count minus the number having an odd total. Then \[ S_{p-1}\equiv\left(\frac{-2}{p}\right)\pmod p, \qquad S_{2p}\equiv-p\pmod {p^2}. \] The two congruences are governed by the same elementary matching sum over $\F_p$, although their proofs use the prime $p$ differently. Their nonzero residues give the conjectured values even in the online game. They also treat the corresponding complete graphs with one perfect matching removed, as well as $K_{2p}$ after deleting some, but not all, of a natural cyclic family of $p$ disjoint perfect matchings.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.22895 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T08:27:54.447Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).