Dirac's theorem on simplicial matroids

Details Dirac's theorem on simplicial matroids Dirac's theorem on simplicial matroids

2006-09-05

arxiv.org/abs/math/0609119v2

Mathematics

Combinatorics

11 pages; Annals of Combinatorics, to appear

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Dirac's theorem on simplicial matroids does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dirac's theorem on simplicial matroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dirac's theorem on simplicial matroids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-554942