2 papers
math.CO2023
Supersolvable saturated matroids and chordal graphs
Dillon Mayhew, Andrew Probert
A matroid is supersolvable if it has a maximal chain of flats each of which is modular. A matroid is saturated if every round flat is modular. In this article we present supersolva…
math.CO2023
Reduced clique graphs: a correction to "Chordal graphs and their clique graphs"
Dillon Mayhew, Andrew Probert
Galinier, Habib, and Paul introduced the reduced clique graph of a chordal graph . The nodes of the reduced clique graph are the maximal cliques of , and two nodes are joined…