Metraipolis › archive › dc_6140cf40cddd

Perfect matching covers of claw-free cubic graphs — arXiv:2610.01137

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.01137
License (as archived)
CC0-1.0
Archived
2026-10-06T17:40:59.976Z
SHA-256 of the archived text
e521dd8ad677dbab97c361ee7c2944778e40c2a7cdff0aed2203bcb053dd4e70
Stable URL of this page
https://metraipolis.com/documento/dc_6140cf40cddd

How to cite

Perfect matching covers of claw-free cubic graphs — arXiv:2610.01137 — arXiv (en), https://arxiv.org/abs/2610.01137 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6140cf40cddd (Metraipolis archive dc_6140cf40cddd, sha256 e521dd8ad677dbab97c361ee7c2944778e40c2a7cdff0aed2203bcb053dd4e70)
BibTeX
@misc{dc6140cf40cddd,
  title = {Perfect matching covers of claw-free cubic graphs — arXiv:2610.01137},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.01137},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6140cf40cddd; sha256 e521dd8ad677dbab97c361ee7c2944778e40c2a7cdff0aed2203bcb053dd4e70},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.01137. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Berge conjecture [Proc. London Math. Soc., 1979] asserts that every bridgeless cubic graph can be covered by five perfect matchings. The 5-cycle double cover conjecture, proposed independently by Preissmann (1981) and Celmins (1984), asserts that every bridgeless graph admits five even subgraphs such that every edge belongs to exactly two of them. Hakobyan and Mkrtchyan [Ars Math. Contemp., 2019] proved that the 5-cycle double cover conjecture holds if and only if every bridgeless claw-free cubic graph can be covered by four perfect matchings. In this paper, we prove that the Berge conjecture holds for bridgeless claw-free cubic graphs. Moreover, we show that every bridgeless claw-free cubic graph $G$ admits four perfect matchings that cover at least $\frac{299}{315}|E(G)|$ edges.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-02 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.01137 — 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-06T16:06:55.838Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).