On crown-free families of subsets
Author:
- 1 August 2014
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 126, 216-231
Abstract
No abstract availableAll Related Versions
Funding Information
- NSF (DMS 1000475, DMS 1300547)
This publication has 18 references indexed in Scilit:
- Q 2-free Families in the Boolean LatticeOrder, 2011
- An Extremal Theorem in the HypercubeThe Electronic Journal of Combinatorics, 2010
- Set Families with a Forbidden SubposetThe Electronic Journal of Combinatorics, 2009
- Largest Families Without an r-ForkOrder, 2007
- Turán’s Theorem in the HypercubeSIAM Journal on Discrete Mathematics, 2007
- A Ramsey-type result for the hypercubeJournal of Graph Theory, 2006
- Largest family withoutJournal of Combinatorial Theory, Series A, 2005
- Subgraphs of a hypercube containing no small even cyclesJournal of Graph Theory, 1992
- Strong versions of Sperner's theoremJournal of Combinatorial Theory, Series A, 1976
- On a lemma of Littlewood and OffordBulletin of the American Mathematical Society, 1945