Showing 2026Show all
3 papers · 1 filter
math.CO2026
Generalized Sterboul--Deming Configurations
Daniel A Jaume, Cristian Panelo, Kevin Pereyra
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 co…
math.CO2026
Generalized Edmonds-Sterboul-Deming configurations. Part 1: Sterboul-Deming graphs
Daniel A. Jaume, Cristian Panelo, Kevin Pereyra
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…
math.CO2026
Generalized Edmonds-Sterboul-Deming configurations Part 3: Determinantal multiplicativity of the SD-KE decomposition of matchable graphs
Daniel A. Jaume, Diego G. Martinez, Cristian Panelo +1
In this work it is shown that the SD-KE decomposition is multiplicative under determinantal-type functions for graphs with perfect matchings, providing a new tool for the study of…