Ordered Ramsey numbers of loose paths and matchings

DOI10.1016/j.disc.2015.09.026zbMath1327.05225arXiv1411.4058OpenAlexW1803931064MaRDI QIDQ898098

Christopher Cox, Derrick Stolee

Publication date: 8 December 2015

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

matchingshypergraph Ramsey theoryloose pathsordered Ramsey numbers

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55)

Related Items

On the abstract chromatic number and its computability for finitely axiomatizable theories ⋮ On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness ⋮ Ramsey numbers for partially-ordered sets ⋮ Minimal ordered Ramsey graphs ⋮ Ramsey numbers of interval 2-chromatic ordered graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The Ramsey number of a graph with bounded maximum degree
• Ordered Ramsey theory and track representations of graphs
• Two remarks on the Burr-Erdős conjecture
• Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
• On the geometric Ramsey number of outerplanar graphs
• Erdős-Szekeres-type theorems for monotone paths and convex bodies
• The Ramsey number for stripes
• Partition relations for cardinal numbers
• Ordered Ramsey numbers