Metraipolis › archive › dc_ec2cc8be2b75
The maximum number of edges in minimal matching covered graphs — arXiv:2609.30978
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30978
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T02:59:13.946Z
- SHA-256 of the archived text
e54f2e83cb40f86cd67ddb0977ed4377b577a5747da98cd75e45cd945d173e18- Stable URL of this page
https://metraipolis.com/documento/dc_ec2cc8be2b75
How to cite
The maximum number of edges in minimal matching covered graphs — arXiv:2609.30978 — arXiv (en), https://arxiv.org/abs/2609.30978 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ec2cc8be2b75 (Metraipolis archive dc_ec2cc8be2b75, sha256 e54f2e83cb40f86cd67ddb0977ed4377b577a5747da98cd75e45cd945d173e18)
BibTeX
@misc{dcec2cc8be2b75,
title = {The maximum number of edges in minimal matching covered graphs — arXiv:2609.30978},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30978},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ec2cc8be2b75; sha256 e54f2e83cb40f86cd67ddb0977ed4377b577a5747da98cd75e45cd945d173e18},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30978. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A connected graph $G$ with at least two vertices is {\em matching covered} if each of its edges lies in a perfect matching. A matching covered graph is {\em minimal} if the removal of any edge results in a graph that is no longer matching covered. Lovász and Plummer [J. Combin. Theory, Ser. B 23 (1977) 127--138] proved by ear decompositions that every minimal matching covered bipartite graph $G$ different from $K_2$ has at most $(3|V(G)|-6)/2$ edges, and this bound is sharp for all $|V(G)|\ge4$. In this paper, we prove that every minimal matching covered nonbipartite graph $G$ with at least 6 vertices has at most $5(|V(G)|-2)/2$ edges, and this bound is sharp for all $|V(G)|\ge6$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-28 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.30978 — 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-08T02:28:17.917Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).