Chordal matroids arising from generalized parallel connections

DOI10.1016/j.aam.2023.102631arXiv2306.07514MaRDI QIDQ6184905

James Dylan Douthitt, James G. Oxley

Publication date: 29 January 2024

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2306.07514

zbMATH Keywords

\(\mathrm{GF}(q)\)-representable matroidsforbidden induced minors

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How is a chordal graph like a supersolvable binary matroid?
• On rigid circuit graphs
• On the cycle polytope of a binary matroid
• Disjoint cocircuits in matroids with large rank
• T-uniqueness of some families of \(k\)-chordal matroids
• Triangulated graphs and the elimination process
• Matroids with Sylvester property
• Supersolvable lattices
• A generalization of chordal graphs
• Binary Supersolvable Matroids and Modular Constructions
• Modular Constructions for Combinatorial Geometries

This page was built for publication: Chordal matroids arising from generalized parallel connections