Pairwise intersections and forbidden configurations

DOI10.1016/j.ejc.2006.05.002zbMath1104.05068MaRDI QIDQ850074

Peter Keevash, Richard P. Anstee

Publication date: 15 November 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Erdős-Ko-Rado theoremComplete Intersection Theoremconjecture of Anstee and Sali

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (10)

Forbidden families of minimal quadratic and cubic configurations ⋮ Repeated columns and an old chestnut ⋮ Multivalued matrices and forbidden configurations ⋮ Evidence for a forbidden configuration conjecture: One more case solved ⋮ Forbidden configurations and Steiner designs ⋮ Set systems without a simplex or a cluster ⋮ Unnamed Item ⋮ Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis ⋮ Stability versions of Erdős-Ko-Rado type theorems via isoperimetry ⋮ Forbidden configurations: boundary cases

Cites Work

• The complete intersection theorem for systems of finite sets
• Forbidding just one intersection
• Small forbidden configurations
• Stability theorems for cancellative hypergraphs
• Small forbidden configurations. IV: The 3 rowed case
• The Turán number of the Fano plane
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Disjoint representability of sets and their complements
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Intersection theorems for systems of finite sets
• On a combinatorial conjecture of Erdös
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Triple Systems Not Containing a Fano Configuration
• On intersecting families of finite sets

This page was built for publication: Pairwise intersections and forbidden configurations