Poset Ramsey numbers: large Boolean lattice versus a fixed poset
From MaRDI portal
Publication:6085871
DOI10.1017/s0963548323000032arXiv2110.07648OpenAlexW3205311113MaRDI QIDQ6085871
Christian Winter, Maria A. Axenovich
Publication date: 8 November 2023
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.07648
Cites Work
- Set families with forbidden subposets
- An improvement of the general bound on the largest family of subsets avoiding a subposet
- Combinatorial partitions of finite posets and lattices - Ramsey lattices
- Exact forbidden subposet results using chain decompositions of the cycle
- Bounds on maximal families of sets not containing three sets with \(A\cap B \subset C\), \(A \not\subset B\)
- A Ramsey theoretic problem for finite ordered sets
- Forbidden induced subposets of given height
- A LYM inequality for induced posets
- Ramsey numbers for partially-ordered sets
- Induced and non-induced poset saturation problems
- Rainbow Ramsey problems for the Boolean lattice
- Poset Ramsey numbers for Boolean lattices
- The Boolean rainbow Ramsey number of antichains, Boolean posets and chains
- Induced and non-induced forbidden subposet problems
- Set families with a forbidden subposet
- Boolean lattices: Ramsey properties and embeddings
- No four subsets forming an \(N\)
- A note on the largest size of families of sets with a forbidden poset
- Set Families With a Forbidden Induced Subposet
- Existence thresholds and Ramsey properties of random posets
- On Families of Subsets With a Forbidden Subposet
- Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems
- On a lemma of Littlewood and Offord
- Ramsey numbers of Boolean lattices
- A construction for Boolean cube Ramsey numbers
- Unnamed Item
This page was built for publication: Poset Ramsey numbers: large Boolean lattice versus a fixed poset
