Boolean lattices: Ramsey properties and embeddings

DOI10.1007/S11083-016-9399-7zbMath1375.05262arXiv1512.05565OpenAlexW2211156271MaRDI QIDQ2407683

Stefan Walzer, Maria A. Axenovich

Publication date: 6 October 2017

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.05565

zbMATH Keywords

Boolean algebrasRamsey theoryBoolean lattices

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Structure theory of lattices (06B05) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (11)

Poset Ramsey numbers for Boolean lattices ⋮ Poset Ramsey numbers: large Boolean lattice versus a fixed poset ⋮ Ramsey numbers of Boolean lattices ⋮ A construction for Boolean cube Ramsey numbers ⋮ The Boolean rainbow Ramsey number of antichains, Boolean posets and chains ⋮ Ramsey numbers for partially-ordered sets ⋮ Poset Ramsey number \(R(P,Q_n)\). I: Complete multipartite posets ⋮ Poset Ramsey number \(R(P,Q_n)\). II: \(\mathrm{N}\)-shaped poset ⋮ Existence thresholds and Ramsey properties of random posets ⋮ On colorings of the Boolean lattice avoiding a rainbow copy of a poset ⋮ Rainbow Ramsey problems for the Boolean lattice

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved bound for the stepping-up lemma
• Combinatorial partitions of finite posets and lattices - Ramsey lattices
• Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs
• Quantitative forms of a theorem of Hilbert
• A Ramsey theoretic problem for finite ordered sets
• Embedding finite posets in cubes
• Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
• Induced and non-induced forbidden subposet problems
• Hypergraph Ramsey numbers: triangles versus cliques
• Multicolor Ramsey numbers for triple systems
• Hypergraph Ramsey numbers
• On Dedekind's Problem: The Number of Isotone Boolean Functions. II
• Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
• Ramsey numbers of sparse hypergraphs

This page was built for publication: Boolean lattices: Ramsey properties and embeddings