Multicoloured extremal problems

DOI10.1016/j.jcta.2004.05.003zbMath1052.05067OpenAlexW2167591244MaRDI QIDQ1883144

Béla Bollobás, Benjamin Sudakov, Peter Keevash

Publication date: 1 October 2004

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2004.05.003

zbMATH Keywords

Erdős-Ko-Rado theoremSperner theoremBLYM inequality

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (5)

A remark on the number of edge colorings of graphs ⋮ Multicolour Sunflowers ⋮ A Rainbow Erdös--Rothschild Problem ⋮ Localized versions of extremal problems ⋮ Several families with incomparability and complementarity conditions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the density of sets of vectors
• On the trace of finite sets
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Logarithmic order of free distributive lattice
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
• On generalized graphs
• A short proof of Sperner's lemma
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• On a lemma of Littlewood and Offord

This page was built for publication: Multicoloured extremal problems