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

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Jaume, Daniel A., Martinez, Diego G., Panelo, Cristian, Pereyra, Kevin
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866914358931488768
author Jaume, Daniel A.
Martinez, Diego G.
Panelo, Cristian
Pereyra, Kevin
author_facet Jaume, Daniel A.
Martinez, Diego G.
Panelo, Cristian
Pereyra, Kevin
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2603_00298
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Generalized Edmonds-Sterboul-Deming configurations Part 3: Determinantal multiplicativity of the SD-KE decomposition of matchable graphs
Jaume, Daniel A.
Martinez, Diego G.
Panelo, Cristian
Pereyra, Kevin
Combinatorics
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.
title Generalized Edmonds-Sterboul-Deming configurations Part 3: Determinantal multiplicativity of the SD-KE decomposition of matchable graphs
topic Combinatorics
url https://arxiv.org/abs/2603.00298