Dirac's theorem on simplicial matroids

DOI10.1007/S00026-009-0012-2MaRDI QIDQ659777zbMATH OpenOpenAlexFDO

Authors Raul Cordovil, Manoel Lemos, Cláudia L. Sales

Publication date 24 January 2012

Published in Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

\(k\)-hyperclique complexesclique (flag) complexesDirac's theorem on chordal graphsHelly dual \(k\)-propertysimplicial matroidsstrong triangulable simplicial matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Perfect graphs (05C17)

Abstract: We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higher-dimensional analogue of clique (or flag) complexes (case k=2) and they are a rich new class of simplicial complexes. We show that Dirac's theorem on chordal graphs has a higher-dimensional analogue in which graphs and clique complexes get replaced, respectively, by simplicial matroids and k-hyperclique complexes. We prove also a higher-dimensional analogue of Stanley's reformulation of Dirac's theorem on chordal graphs.

Recommendations

• Higher chordality: from graphs to complexes
• Dirac's theorem on chordal graphs and Alexander duality
• Minors of simplicial complexes
• A Dirac-type characterization of \(k\)-chordal graphs
• Large simple \(d\)-cycles in simplicial complexes

Cites work

• scientific article; zbMATH DE number 4016785 (Why is no real title available?)
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 49099 (Why is no real title available?)
• scientific article; zbMATH DE number 3342868 (Why is no real title available?)
• scientific article; zbMATH DE number 3365295 (Why is no real title available?)
• Algorithmic graph theory and perfect graphs
• Dirac's theorem on chordal graphs and Alexander duality
• Geometries simpliciales unimodulaires
• How is a chordal graph like a supersolvable binary matroid?
• On rigid circuit graphs
• Simplical Geometry and Transportation Polytopes
• Supersolvable lattices
• Theory of Matroids

Cited in

(9)

• Non-ridge-chordal complexes whose clique complex has shellable Alexander dual
• Cycles in the coprime hypergraph of integers
• Davies-Gaffney-Grigor'yan lemma on simplicial complexes
• Chordality, \(d\)-collapsibility, and componentwise linear ideals
• Kruskal-Katona type theorems for clique complexes arising from chordal and strongly chordal graphs
• scientific article; zbMATH DE number 3970765 (Why is no real title available?)
• Higher chordality: from graphs to complexes
• Codismantlability and projective dimension of the Stanley-Reisner ring of special hypergraphs
• Dirac's theorem on chordal graphs and Alexander duality

This page was built for publication: Dirac's theorem on simplicial matroids

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