Supersolvable saturated matroids and chordal graphs

DOI10.1016/j.aam.2023.102616arXiv2301.03776OpenAlexW4386833613MaRDI QIDQ6144421

Dillon Mayhew, Andrew Probert

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/2301.03776

zbMATH Keywords

optimal decompositionmaximum-weight spanning tree

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

• How is a chordal graph like a supersolvable binary matroid?
• On rigid circuit graphs
• Minimal triangulations of graphs: a survey
• Matroid tree-width
• Algorithmic graph theory and perfect graphs
• Supersolvable lattices
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Supersolvable saturated matroids and chordal graphs