Chordal matroids arising from generalized parallel connections

DOI10.1016/J.AAM.2023.102631MaRDI QIDQ6184905zbMATH OpenFDO

Authors James Dylan Douthitt, James 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

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

Abstract: A graph is chordal if every cycle of length at least four has a chord. In 1961, Dirac characterized chordal graphs as those graphs that can be built from complete graphs by repeated clique-sums. Generalizing this, we consider the class of simple $GF(q)$-representable matroids that can be built from projective geometries over $GF(q)$ by repeated generalized parallel connections across projective geometries. We show that this class of matroids is closed under induced minors. We characterize the class by its forbidden induced minors;the case when $q=2$ is distinctive.

Recommendations

• Chordal matroids arising from generalized parallel connections. II
• Chordal characterization of graphic matroids
• Families of matroids induced by classes of graphs
• Chords and disjoint paths in matroids
• scientific article; zbMATH DE number 1028231

Cites work

• A generalization of chordal graphs
• Binary Supersolvable Matroids and Modular Constructions
• Disjoint cocircuits in matroids with large rank
• How is a chordal graph like a supersolvable binary matroid?
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3322854 (Why is no real title available?)
• scientific article; zbMATH DE number 3057679 (Why is no real title available?)
• Matroids with Sylvester property
• Modular Constructions for Combinatorial Geometries
• On rigid circuit graphs
• On the cycle polytope of a binary matroid
• Supersolvable lattices
• T-uniqueness of some families of \(k\)-chordal matroids
• Triangulated graphs and the elimination process

Cited in

(2)

• Chordal matroids arising from generalized parallel connections. II
• Classes of binary matroids with small lists of excluded induced minors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184905)