On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness
From MaRDI portal
Publication:2225445
DOI10.1016/j.ejc.2020.103242zbMath1458.05164arXiv1807.05038OpenAlexW3088844073MaRDI QIDQ2225445
Paweł Prałat, Douglas B. West, Xavier Pérez-Giménez
Publication date: 8 February 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.05038
2-person games (91A05) Hypergraphs (05C65) Games involving graphs (91A43) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multicolor on-line degree Ramsey numbers of trees
- The on-line degree Ramsey number of cycles
- Online Ramsey theory for planar graphs
- The size Ramsey number of a directed path
- On-line Ramsey numbers of paths and cycles
- Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems
- On-line Ramsey theory for bounded degree graphs
- Trees with an on-line degree Ramsey number of four
- Ordered Ramsey theory and track representations of graphs
- Ordered Ramsey numbers of loose paths and matchings
- The size Ramsey number
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
- Monochromatic paths in random tournaments
- On-line Ramsey theory
- Coloring number and on-line Ramsey theory for graphs and hypergraphs
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- Off-diagonal hypergraph Ramsey numbers
- A decomposition theorem for partially ordered sets
- On-line Ramsey Numbers
- Erdős-Szekeres-type theorems for monotone paths and convex bodies
- A Simple Proof of a Theorem of Erdös and Szekeres*
- A note on on-line Ramsey numbers for quadrilaterals
- Hypergraph Ramsey numbers
- On size Ramsey number of paths, trees, and circuits. I
- Two variants of the size Ramsey number
- On some Multicolor Ramsey Properties of Random Graphs
- An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
- Path Ramsey Number for Random Graphs
- Ramsey numbers of ordered graphs
- Ordered Ramsey numbers
This page was built for publication: On-line size Ramsey number for monotone \(k\)-uniform ordered paths with uniform looseness