Metraipolis › archive › dc_2756951bfbf3

Generalized Sterboul--Deming Configurations — arXiv:2609.12128

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.12128
License (as archived)
CC0-1.0
Archived
2026-10-16T03:49:14.140Z
SHA-256 of the archived text
5cce80f8ede8b348fec4e686e57a705bd12d28179fcd679d14cda7ea3b8cd9a1
Stable URL of this page
https://metraipolis.com/documento/dc_2756951bfbf3

How to cite

Generalized Sterboul--Deming Configurations — arXiv:2609.12128 — arXiv (en), https://arxiv.org/abs/2609.12128 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2756951bfbf3 (Metraipolis archive dc_2756951bfbf3, sha256 5cce80f8ede8b348fec4e686e57a705bd12d28179fcd679d14cda7ea3b8cd9a1)
BibTeX
@misc{dc2756951bfbf3,
  title = {Generalized Sterboul--Deming Configurations — arXiv:2609.12128},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.12128},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2756951bfbf3; sha256 5cce80f8ede8b348fec4e686e57a705bd12d28179fcd679d14cda7ea3b8cd9a1},
  year = {2026}
}

Archived text

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

Sterboul and Deming gave classical matching-based characterizations of non-Kőnig--Egerváry graphs through flower--posy and blossom-pair configurations. We consider two classical configuration families, denoted \(T\) and \(S\), and introduce a new walk-based family \(J\), based on \(J\)-flowers and \(J\)-posies. Our main result proves that, for every graph \(G\), \[ \SD_T(G)=\SD_S(G)=\SD_J(G). \] Thus the additional flexibility of the \(J\)-framework preserves the set of vertices detected by the classical configurations. The proof is vertex-preserving and passes through strict-Hall structure in traces of \(J\)-posies. As a consequence, every prescribed vertex of a connected matchable strict-Hall graph lies in a rigid \(T\)-posy for a suitable perfect matching, linking the theory naturally with matching-covered graphs.

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