Oriented cobicircular matroids are $GSP$
Santiago Guzm\'an-Pro, Winfried Hochst\"attler

TL;DR
This paper explores the properties of oriented cobicircular matroids, demonstrating they are generalized series parallel (GSP), and discusses implications for graph coloring conjectures and matroid classes.
Contribution
It proves that oriented cobicircular matroids are GSP, extending the class of known GSP matroids and providing new techniques for establishing GSP status.
Findings
Oriented cobicircular matroids are GSP.
Disproved conjecture that all gammoids have positive colines.
Introduced a simpler method to show certain matroids are GSP.
Abstract
Colourings and flows are well-known dual notions in Graph Theory. In turn, the definition of flows in graphs naturally extends to flows in oriented matroids. So, the colour-flow duality gives a generalization of Hadwiger's conjecture about graph colourings, to a conjecture about coflows of oriented matroids. The first non-trivial case of Hadwiger's conjecture for oriented matroids reads as follows. If is an -minor free oriented matroid, then has a now-where -coflow, i.e., it is -colourable in the sense of Hochst\"attler-Ne\v{s}et\v{r}il. The class of generalized series parallel () oriented matroids is a class of -colourable oriented matroids with no -minor. So far, the only technique towards proving that all orientations of a class of -minor free matroids are (and thus -colourable), has been to show…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Advanced Combinatorial Mathematics · Graph Labeling and Dimension Problems
