2000 character limit reached
Positroid envelopes and graphic positroids (2402.17841v2)
Published 27 Feb 2024 in math.CO
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.