Generalized Edmonds-Sterboul-Deming configurations Part 3: Determinantal multiplicativity of the SD-KE decomposition of matchable graphs

arXiv (Cornell University) 2026 Preprint Open access

Read full text
Authors: Daniel Alejandro Jaume, Diego G. Martinez, Cristian Panelo, Kevin Pereyra
DOI: 10.48550/arxiv.2603.00298
Cited by: 0

Abstract

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 unimodular and singular matchable graphs.

Fields of Study & Subjects

Advanced Graph Theory Research Advanced Combinatorial Mathematics Graph theory and applications

Publication details

Journal / source
arXiv (Cornell University)
Publication date
27 February 2026
Language
EN
Document type
Preprint