Erdős-Ko-Rado theorems for simplicial complexes

From MaRDI portal
Publication:2431599

DOI10.1016/J.JCTA.2010.11.022zbMATH Open1231.05308arXiv1001.0313OpenAlexW2061880181MaRDI QIDQ2431599FDOQ2431599


Authors: Russ Woodroofe Edit this on Wikidata


Publication date: 15 April 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Abstract: A recent framework for generalizing the Erdos-Ko-Rado Theorem, due to Holroyd, Spencer, and Talbot, defines the Erdos-Ko-Rado property for a graph in terms of the graph's independent sets. Since the family of all independent sets of a graph forms a simplicial complex, it is natural to further generalize the Erdos-Ko-Rado property to an arbitrary simplicial complex. An advantage of working in simplicial complexes is the availability of algebraic shifting, a powerful shifting (compression) technique, which we use to verify a conjecture of Holroyd and Talbot in the case of sequentially Cohen-Macaulay near-cones.


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




Recommendations




Cites Work


Cited In (23)





This page was built for publication: Erdős-Ko-Rado theorems for simplicial complexes

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