On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem
From MaRDI portal
Publication:3895483
DOI10.1112/S0025579300015345zbMath0449.05001WikidataQ122939125 ScholiaQ122939125MaRDI QIDQ3895483
Publication date: 1981
Published in: Mathematika (Search for Journal in Brave)
Permutations, words, matrices (05A05) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Some intersection theorems for ordered sets and graphs ⋮ Several families with incomparability and complementarity conditions
Cites Work
- On Sperner families satisfying an additional condition
- Set colourings of graphs
- A simple proof of the Erdős-Chao Ko-Rado theorem
- An Extremal Set-Intersection Theorem
- An Intersection Theorem for a Collection of Families of Subsets of a Finite Set
- On a Conjecture of Chvátal on m -Intersecting Hypergraphs
- On separating systems of a finite set