Set systems without a simplex or a cluster
- 1 March 2010
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 30 (2) , 175-200
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Intersecting Families are Essentially Contained in JuntasCombinatorics, Probability and Computing, 2009
- Pairwise intersections and forbidden configurationsEuropean Journal of Combinatorics, 2006
- On the hardness of approximating vertex coverAnnals of Mathematics, 2005
- The number of graphs without forbidden subgraphsJournal of Combinatorial Theory, Series B, 2004
- An Elementary View of Euler's Summation FormulaThe American Mathematical Monthly, 1999
- A Homological Approach to Two Problems on Finite SetsJournal of Algebraic Combinatorics, 1999
- The Complete Intersection Theorem for Systems of Finite SetsEuropean Journal of Combinatorics, 1997
- On a Conjecture of Chvátal on m -Intersecting HypergraphsBulletin of the London Mathematical Society, 1977
- An Extremal Set-Intersection TheoremJournal of the London Mathematical Society, 1974
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1961