The Projective Planarity Question for Matroids of $3$-Nets and Biased Graphs
Rigoberto Fl\'orez, Thomas Zaslavsky

TL;DR
This paper establishes algebraic criteria for embedding matroids derived from biased graphs and 3-nets into non-Desarguesian projective planes, linking graph theory, algebra, and geometry.
Contribution
It provides new algebraic conditions for realizing 3-nets and biased graphs in arbitrary projective planes, extending previous results beyond Desarguesian spaces.
Findings
Criteria depend on quasigroup embeddability into ternary rings
Every finite 3-node biased graph is a subgraph of a biased expansion of a triangle
Open problem: existence of finite quasigroups not embeddable in any finite ternary ring
Abstract
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift matroid. A classical question in matroid theory is whether a matroid can be embedded in a projective geometry. There is no known general answer, but for matroids of biased graphs it is possible to give algebraic criteria. Zaslavsky has previously given such criteria for embeddability of biased-graphic matroids in Desarguesian projective spaces; in this paper we establish criteria for the remaining case, that is, embeddability in an arbitrary projective plane that is not necessarily Desarguesian. The criteria depend on the embeddability of a quasigroup associated to the graph into the additive or multiplicative loop of a ternary coordinate ring for…
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
Topicsgraph theory and CDMA systems · Quasicrystal Structures and Properties · Mathematics and Applications
