The Circuit-Cocircuit Intersection Conjecture for Intersection Size $k\le6$
Jaeho Shin

TL;DR
This paper proves Oxley's conjecture for matroids with circuit-cocircuit intersections of size up to 6, confirming that larger intersections imply smaller ones in these cases.
Contribution
The paper establishes the validity of Oxley's conjecture for all intersection sizes up to 6, extending previous partial results.
Findings
Oxley's conjecture holds for k ≤ 6
Matroids with large circuit-cocircuit intersections have smaller ones
The result confirms the conjecture for a new range of k
Abstract
Oxley conjectured (1992) that if a matroid has a circuit-cocircuit intersection of size , it has a circuit-cocircuit intersection of size . We show that this conjecture holds 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
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs · Limits and Structures in Graph Theory
