Ramsey numbers for degree monotone paths
From MaRDI portal
Publication:2374167
DOI10.1016/j.disc.2016.07.025zbMath1351.05149arXiv1503.07891OpenAlexW2299120352MaRDI QIDQ2374167
Yair Caro, Raphael Yuster, Christina Zarb
Publication date: 14 December 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.07891
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turán theorems with repeated degrees
- Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs
- Some Ramsey nu mbers for directed graphs
- Three-color Ramsey numbers for paths
- Higher-order Erdős-Szekeres theorems
- The saturation number for the length of degree monotone paths
- Monochromatic paths in edge-colored graphs
- Increasing paths in edge ordered graphs
- A Ramsey-type problem in directed and bipartite graphs
- On Complementary Graphs
- Ramsey Problems with Bounded Degree Spread
- People Who Know People
- Degree Monotone Paths
- Some Combinatorial Theorems on Monotonicity
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts
This page was built for publication: Ramsey numbers for degree monotone paths