A signed graph is a representation of an even cycle matroid M if the cycles of M correspond to the even cycles of that signed graph. Two long standing open questions regarding even cycle matroids are the problem of finding an excluded minor characterization and the problem of efficiently recognizing this class of matroids. Progress on these problems has been hampered by the fact that even cycle matroids can have an arbitrary number of pairwise inequivalent representations (for a natural definition of equivalence). We show that we can bound the number of inequivalent representations of an even cycle matroid M (under some mild connectivity assumptions) if M contains any fixed size minor that is not a projection of a graphic matroid. For instance, any connected even cycle matroid which contains R10 as a minor has at most 6 inequivalent representations

Stabilizer theorems for even cycle matroids / Guenin, Bertrand; Pivotto, Irene; Wollan, PAUL JOSEPH. - In: JOURNAL OF COMBINATORIAL THEORY. - ISSN 0095-8956. - STAMPA. - 118:(2016), pp. 44-75. [10.1016/j.jctb.2016.01.006]

Stabilizer theorems for even cycle matroids

WOLLAN, PAUL JOSEPH
2016

Abstract

A signed graph is a representation of an even cycle matroid M if the cycles of M correspond to the even cycles of that signed graph. Two long standing open questions regarding even cycle matroids are the problem of finding an excluded minor characterization and the problem of efficiently recognizing this class of matroids. Progress on these problems has been hampered by the fact that even cycle matroids can have an arbitrary number of pairwise inequivalent representations (for a natural definition of equivalence). We show that we can bound the number of inequivalent representations of an even cycle matroid M (under some mild connectivity assumptions) if M contains any fixed size minor that is not a projection of a graphic matroid. For instance, any connected even cycle matroid which contains R10 as a minor has at most 6 inequivalent representations
2016
Even cycle matroid; Matroid representations; Signed graphs; Discrete Mathematics and Combinatorics; Theoretical Computer Science; Computational Theory and Mathematics
01 Pubblicazione su rivista::01a Articolo in rivista
Stabilizer theorems for even cycle matroids / Guenin, Bertrand; Pivotto, Irene; Wollan, PAUL JOSEPH. - In: JOURNAL OF COMBINATORIAL THEORY. - ISSN 0095-8956. - STAMPA. - 118:(2016), pp. 44-75. [10.1016/j.jctb.2016.01.006]
File allegati a questo prodotto
File Dimensione Formato  
Guenin_Stabilizer_2016.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 701.92 kB
Formato Adobe PDF
701.92 kB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/925086
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 5
social impact