Ramsey numbers for partially-ordered sets
From MaRDI portal
Publication:1789062
DOI10.1007/s11083-017-9449-9zbMath1417.05238arXiv1512.05261OpenAlexW2964048878MaRDI QIDQ1789062
Christopher Cox, Derrick Stolee
Publication date: 9 October 2018
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.05261
Ramsey theoryBoolean latticepartially ordered setsHasse diagramTurán-type problemsordered graphsLubell functionordered Ramsey numbersBoolean Ramsey numbers
Combinatorics of partially ordered sets (06A07) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Related Items (7)
On the abstract chromatic number and its computability for finitely axiomatizable theories ⋮ 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 ⋮ On colorings of the Boolean lattice avoiding a rainbow copy of a poset ⋮ Rainbow Ramsey problems for the Boolean lattice
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Boolean algebras and Lubell functions
- An improvement of the general bound on the largest family of subsets avoiding a subposet
- Diamond-free families
- Combinatorial partitions of finite posets and lattices - Ramsey lattices
- Ordered Ramsey theory and track representations of graphs
- Ordered Ramsey numbers of loose paths and matchings
- A Ramsey theoretic problem for finite ordered sets
- A Ramseyian theorem on products of trees
- Fibres and ordered set coloring
- Bipartite Ramsey numbers and Zarankiewicz numbers
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- On diamond-free subposets of the Boolean lattice
- The partition method for poset-free families
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- On the geometric Ramsey number of outerplanar graphs
- Poset-free families and Lubell-boundedness
- Boolean lattices: Ramsey properties and embeddings
- Largest families without an \(r\)-fork
- Largest family without \(A \cup B \subseteq C \cap D\)
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- On Families of Subsets With a Forbidden Subposet
- A new upper bound for the bipartite Ramsey problem
- The Chromatic Number of Kneser Hypergraphs
- A bipartite Ramsey problem and the Zarankiewicz numbers
- An Upper Bound on Zarankiewicz' Problem
- Ramsey numbers of ordered graphs
- Ordered Ramsey numbers
- Ordered Ramsey numbers
This page was built for publication: Ramsey numbers for partially-ordered sets
