Erdős-Ko-Rado type theorems for simplicial complexes
From MaRDI portal
Publication:2363100
zbMath1366.05126MaRDI QIDQ2363100
Publication date: 13 July 2017
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i2p38
Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of simplicial complexes (05E45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Improved bounds for Erdős' matching conjecture
- Intersecting faces of a simplicial complex via algebraic shifting
- \(g\)-elements, finite buildings and higher Cohen-Macaulay connectivity.
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- Algebraic shifting and sequentially Cohen-Macaulay simplicial complexes
- Erdős-Ko-Rado theorems for simplicial complexes
- Algebraic shifting and basic constructions on simplicial complexes
- Erdös–Ko–Rado Theorem—22 Years Later
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Extremal t -intersecting sub-families of hereditary families
- Monomial Ideals
This page was built for publication: Erdős-Ko-Rado type theorems for simplicial complexes