Extremal problems for sets forming Boolean algebras and complete partite hypergraphs

DOI10.1006/jcta.1999.2973zbMath0939.05079OpenAlexW2007400275MaRDI QIDQ1818218

Alexander Sidorenko, David S. Gundersson, Vojtěch Rödl

Publication date: 31 January 2000

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

Full work available at URL: https://semanticscholar.org/paper/f823f2134869bb3ac8f1ae7f566919247221acce

zbMATH Keywords

Boolean algebrahypergraphsRamsey functionsfinite families of setsHales-Jewitt theoremprobabilistic proofs

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Structure theory of Boolean algebras (06E05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (17)

Forbidden induced subposets of given height ⋮ Hilbert cubes in arithmetic sets ⋮ An intersection theorem for four sets ⋮ Poset Ramsey numbers for Boolean lattices ⋮ Hilbert’s Proof of His Irreducibility Theorem ⋮ Maximum union-free subfamilies ⋮ Boolean lattices: Ramsey properties and embeddings ⋮ Some extremal results on complete degenerate hypergraphs ⋮ Uniform chain decompositions and applications ⋮ Extremal problems in hypergraph colourings ⋮ Random multilinear maps and the Erd\H{o}s box problem ⋮ A new proof of the density Hales-Jewett theorem ⋮ Boolean algebras and Lubell functions ⋮ Short Proofs of Some Extremal Results ⋮ Ramsey numbers for partially-ordered sets ⋮ A note on the random greedy independent set algorithm ⋮ Forbidding intersection patterns between layers of the cube

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantitative forms of a theorem of Hilbert
• A Ramsey-Sperner theorem
• Union-free families of sets and equations over fields
• Partitioning a power set into union-free classes
• On multicolor Ramsey numbers for complete bipartite graphs
• Strong versions of Sperner's theorem
• Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains
• A density version of the Hales-Jewett theorem
• Ramsey-Sperner theory
• On the number of edges of quadrilateral-free graphs
• Lexicographic matching in Boolean algebras
• On extremal problems of graphs and generalized graphs
• Graph Theory and Probability
• Über ein Problem von K. Zarankiewicz
• Regularity and Positional Games
• On the maximum number of edges in a c₄‐free subgraph of q_n
• Extremal Problems for Affine Cubes of Integers
• A short proof of Sperner's lemma
• On sets of integers containing no four elements in arithmetic progression
• On Graphs that do not Contain a Thomsen Graph
• On Collections of Subsets Containing No 4-Member Boolean Algebra
• On a problem of K. Zarankiewicz
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems

This page was built for publication: Extremal problems for sets forming Boolean algebras and complete partite hypergraphs