Ramsey numbers for partially-ordered sets
From MaRDI portal
Publication:1789062
Abstract: We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of partially-ordered sets to form host graphs for Ramsey problems. We explore connections to well studied Tur'an-type problems in partially-ordered sets, particularly those in the Boolean lattice. We find a strong difference between Ramsey numbers on the Boolean lattice and ordered Ramsey numbers when the partial ordering on the graphs have large antichains.
Recommendations
Cites work
- scientific article; zbMATH DE number 1186105 (Why is no real title available?)
- scientific article; zbMATH DE number 3520445 (Why is no real title available?)
- scientific article; zbMATH DE number 1341925 (Why is no real title available?)
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- A Ramsey theoretic problem for finite ordered sets
- A Ramseyian theorem on products of trees
- A bipartite Ramsey problem and the Zarankiewicz numbers
- A new upper bound for the bipartite Ramsey problem
- An Upper Bound on Zarankiewicz' Problem
- An improvement of the general bound on the largest family of subsets avoiding a subposet
- Bipartite Ramsey numbers and Zarankiewicz numbers
- Boolean algebras and Lubell functions
- Boolean lattices: Ramsey properties and embeddings
- Combinatorial partitions of finite posets and lattices - Ramsey lattices
- Diamond-free families
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Fibres and ordered set coloring
- Largest families without an \(r\)-fork
- Largest family without \(A \cup B \subseteq C \cap D\)
- On diamond-free subposets of the Boolean lattice
- On families of subsets with a forbidden subposet
- On the geometric Ramsey number of outerplanar graphs
- Ordered Ramsey numbers
- Ordered Ramsey numbers
- Ordered Ramsey numbers of loose paths and matchings
- Ordered Ramsey theory and track representations of graphs
- Poset-free families and Lubell-boundedness
- Ramsey numbers of ordered graphs
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- The Chromatic Number of Kneser Hypergraphs
- The partition method for poset-free families
Cited in
(18)- On the abstract chromatic number and its computability for finitely axiomatizable theories
- In search of the first-order part of Ramsey's theorem for pairs
- Rainbow Ramsey problems for the Boolean lattice
- Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory
- On a Ramsey-theoretic property of orders
- Unordered canonical Ramsey numbers
- Poset Ramsey number \(R(P,Q_n)\). I: Complete multipartite posets
- Poset Ramsey number \(R(P,Q_n)\). II: \(\mathrm{N}\)-shaped poset
- The Boolean rainbow Ramsey number of antichains, Boolean posets and chains
- Ramsey properties of countably infinite partial orderings
- Poset Ramsey numbers: large Boolean lattice versus a fixed poset
- Ramsey numbers of Boolean lattices
- Ramsey partial orders from acyclic graphs
- scientific article; zbMATH DE number 3902698 (Why is no real title available?)
- On colorings of the Boolean lattice avoiding a rainbow copy of a poset
- A Ramsey theorem for partial orders with linear extensions
- A construction for Boolean cube Ramsey numbers
- scientific article; zbMATH DE number 4023329 (Why is no real title available?)
This page was built for publication: Ramsey numbers for partially-ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789062)
