Triangle-roundedness in matroids
Jo\~ao Paulo Costalonga, Xianqiang Zhou

TL;DR
This paper investigates the property of triangle-roundedness in matroids, extending previous results to non-binary cases and demonstrating that the matroid of the complete graph on five vertices is triangle-rounded within regular matroids.
Contribution
It generalizes Reid's result by removing a key condition and extends the concept of triangle-roundedness to non-binary matroids, with an application to regular matroids.
Findings
Extended Reid's result to non-binary matroids
Proved $M(K_5)$ is triangle-rounded in regular matroids
Dropped the element existence condition in the main theorem
Abstract
A matroid is said to be triangle-rounded in a class of matroids if each -connected matroid with a triangle and an -minor has an -minor with as triangle. Reid gave a result useful to identify such matroids as stated next: suppose that is a binary -connected matroid with a -connected minor , is a triangle of and ; then has a -connected minor with an -minor such that is a triangle of and . We strengthen this result by dropping the condition that such element exists and proving that there is a -connected minor of with an -minor such that is a triangle of and . This result is extended to the non-binary case and, as an application, we prove that is triangle-rounded in the class of the regular…
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.
