Positroid envelopes and graphic positroids
Combinatorics
2025-01-28 v2
Abstract
Positroids are matroids realizable by real matrices with all nonnegative maximal minors. They partition the ordered matroids into equivalence classes, called positroid envelope classes, by their Grassmann necklaces. We give an explicit graph construction that shows that every positroid envelope class contains a graphic matroid. We prove that a graphic positroid is the unique matroid in its positroid envelope class. Finally, we show that every graphic positroid has an oriented graph representable by a signed incidence matrix with all nonnegative minors.
Keywords
Cite
@article{arxiv.2402.17841,
title = {Positroid envelopes and graphic positroids},
author = {Jeremy Quail and Puck Rombach},
journal= {arXiv preprint arXiv:2402.17841},
year = {2025}
}