Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
From MaRDI portal
Recommendations
- Boolean lattices: Ramsey properties and embeddings
- Boolean algebras and Lubell functions
- On algorithmic methods of analysis of two-colorings of hypergraphs
- Extremal problems for colorings of simple hypergraphs and applications
- The Boolean rainbow Ramsey number of antichains, Boolean posets and chains
Cites work
- scientific article; zbMATH DE number 3645097 (Why is no real title available?)
- scientific article; zbMATH DE number 3841900 (Why is no real title available?)
- scientific article; zbMATH DE number 4200236 (Why is no real title available?)
- scientific article; zbMATH DE number 4029619 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3717358 (Why is no real title available?)
- scientific article; zbMATH DE number 3758370 (Why is no real title available?)
- scientific article; zbMATH DE number 66576 (Why is no real title available?)
- scientific article; zbMATH DE number 3482343 (Why is no real title available?)
- scientific article; zbMATH DE number 3517154 (Why is no real title available?)
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- scientific article; zbMATH DE number 686998 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3394140 (Why is no real title available?)
- scientific article; zbMATH DE number 3031694 (Why is no real title available?)
- A Ramsey-Sperner theorem
- A density version of the Hales-Jewett theorem
- A short proof of Sperner's lemma
- Decompositions of \({\mathcal B}_ n\) and \({\varPi}_ n\) using symmetric chains
- Extremal Problems for Affine Cubes of Integers
- Graph Theory and Probability
- Lexicographic matching in Boolean algebras
- On Collections of Subsets Containing No 4-Member Boolean Algebra
- On Graphs that do not Contain a Thomsen Graph
- 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
- On a problem of K. Zarankiewicz
- On extremal problems of graphs and generalized graphs
- On multicolor Ramsey numbers for complete bipartite graphs
- On sets of integers containing no four elements in arithmetic progression
- On the maximum number of edges in a c4‐free subgraph of qn
- On the number of edges of quadrilateral-free graphs
- Partitioning a power set into union-free classes
- Quantitative forms of a theorem of Hilbert
- Ramsey-Sperner theory
- Regularity and Positional Games
- Strong versions of Sperner's theorem
- Union-free families of sets and equations over fields
- Über ein Problem von K. Zarankiewicz
Cited in
(17)- An intersection theorem for four sets
- Forbidden induced subposets of given height
- Forbidding intersection patterns between layers of the cube
- Extremal problems in hypergraph colourings
- Hilbert’s Proof of His Irreducibility Theorem
- A new proof of the density Hales-Jewett theorem
- Uniform chain decompositions and applications
- Random multilinear maps and the Erdős box problem
- Some extremal results on complete degenerate hypergraphs
- Boolean algebras and Lubell functions
- Boolean lattices: Ramsey properties and embeddings
- Short proofs of some extremal results
- A note on the random greedy independent set algorithm
- Maximum union-free subfamilies
- Ramsey numbers for partially-ordered sets
- Hilbert cubes in arithmetic sets
- Poset Ramsey numbers for Boolean lattices
This page was built for publication: Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818218)
