arXiv · 2611.15741
Skew Zero Forcing Matroids
Abstract
Matroid theory and skew zero forcing (SZF) in graphs are both topics of mathematical interest, but very little is known about their overlap. When a matroid arises from a graph in the traditional way, the edges of the graph correspond with the elements of the matroid. However, the SZF color change rule for graphs can be viewed as a closure operator on the vertices of a graph. As such, when a matroid arises from a graph via SZF, the vertices of the graph correspond with the elements of the matroid. We call such a matroid SZF-realizable. Notably, unlike the traditional method of obtaining a matroid from a graph, skew zero forcing in a graph does not always give rise to a matroid. This paper establishes fundamental results in graph and matroid theory with respect to (1) which matroids are SZF-realizable, and (2) what kinds of graphs do and do not give rise to SZF matroids. The main result of the paper focuses on cycle matroids of outerplanar graphs.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Dennis Hall, Simon Pfeil, Jesse Taylor. 2026-11-11. Skew Zero Forcing Matroids. https://searcharxiv.com/abs/2611.15741
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.