Generalized Edmonds-Sterboul-Deming configurations. Part 1: Sterboul-Deming graphs
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911503330836480 |
|---|---|
| author | Jaume, Daniel A. Panelo, Cristian Pereyra, Kevin |
| author_facet | Jaume, Daniel A. Panelo, Cristian Pereyra, Kevin |
| contents | We introduce two new types of graph configurations, the Jflower and the Jposy, which generalize the classical flower and posy configurations of Edmonds, Sterboul, and Deming in the context of maximum matchings. These generalized configurations allow greater flexibility in characterizing non-Konig-Egerváry graphs and provide new tools for studying matching-theoretic properties.
Our main result shows that the sets of vertices covered by classical configurations (flowers and posies), restricted configurations (Tposies), and generalized configurations (Jflowers and Jposies) coincide. This equivalence yields a unified characterization of what we call Sterboul-Deming graphs, graphs in which every vertex belongs to some configuration relative to an appropriate maximum matching. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_09795 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Generalized Edmonds-Sterboul-Deming configurations. Part 1: Sterboul-Deming graphs Jaume, Daniel A. Panelo, Cristian Pereyra, Kevin Combinatorics We introduce two new types of graph configurations, the Jflower and the Jposy, which generalize the classical flower and posy configurations of Edmonds, Sterboul, and Deming in the context of maximum matchings. These generalized configurations allow greater flexibility in characterizing non-Konig-Egerváry graphs and provide new tools for studying matching-theoretic properties. Our main result shows that the sets of vertices covered by classical configurations (flowers and posies), restricted configurations (Tposies), and generalized configurations (Jflowers and Jposies) coincide. This equivalence yields a unified characterization of what we call Sterboul-Deming graphs, graphs in which every vertex belongs to some configuration relative to an appropriate maximum matching. |
| title | Generalized Edmonds-Sterboul-Deming configurations. Part 1: Sterboul-Deming graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2603.09795 |