Metraipolis › archive › dc_28fcad552fb3
Bricks that every removable edge is solitary — arXiv:2608.12832
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.12832
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T04:47:57.832Z
- SHA-256 of the archived text
525e7f0789913c7216140042fa480b8b235d255782302c27b359862bb5786ac5- Stable URL of this page
https://metraipolis.com/documento/dc_28fcad552fb3
How to cite
Bricks that every removable edge is solitary — arXiv:2608.12832 — arXiv (en), https://arxiv.org/abs/2608.12832 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_28fcad552fb3 (Metraipolis archive dc_28fcad552fb3, sha256 525e7f0789913c7216140042fa480b8b235d255782302c27b359862bb5786ac5)
BibTeX
@misc{dc28fcad552fb3,
title = {Bricks that every removable edge is solitary — arXiv:2608.12832},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.12832},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_28fcad552fb3; sha256 525e7f0789913c7216140042fa480b8b235d255782302c27b359862bb5786ac5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12832. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A brick is a 3-connected graph $G$ such that $G-u-v$ has a perfect matching for any two distinct vertices $u,v\in V(G)$. An edge $e$ in a matching covered graph $G$ is removable if $G-e$ is matching covered. We say that a removable edge $e$ in a brick $G$ is $b$-invariant if $b(G-e)=b(G)=1$, where $b(H)$ denotes the number of bricks in the tight cut decomposition of a matching covered graph $H$. An edge of a graph is solitary if it lies in precisely one perfect matching. Lucchesi and Murty proposed the problem of characterizing bricks, distinct from $K_4$, $\overline{C_6}$ and the Petersen graph, in which every $b$-invariant edge is solitary. Note that every $b$-invariant edge is removable. In this paper, we strengthen the condition by requiring that every removable edge is solitary. We show that every nonsolid brick satisfying this strengthened condition can be obtained by repeatedly splicing odd wheels (up to multiple edges). Moreover, properties of such bricks imply that "repeatedly splicing odd wheels" cannot be replaced by "repeatedly splicing copies of $K_4$".
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.12832 — 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-19T04:28:16.160Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).