Degree bipartite Ramsey numbers
From MaRDI portal
Publication:2233618
DOI10.11650/tjm/201106zbMath1475.05117arXiv1909.00147OpenAlexW3107803608MaRDI QIDQ2233618
Publication date: 11 October 2021
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.00147
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition of bounded degree graphs into \(C_4\)-free subgraphs
- The fractional version of Hedetniemi's conjecture is true
- Degree Ramsey numbers for cycles and blowups of trees
- Expanding graphs contain all small trees
- The Ramsey property for graphs with forbidden complete subgraphs
- The size Ramsey number
- Partitioning into graphs with only small components
- Chromatic Ramsey numbers
- Cycles of even length in graphs
- Degree Ramsey numbers for even cycles
- Degree Ramsey Numbers of Graphs
- A Folkman Linear Family
- A note on the Size-Ramsey number of long subdivisions of graphs
- On size Ramsey number of paths, trees, and circuits. I
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- On a problem of K. Zarankiewicz
- On size Ramsey numbers of graphs with bounded degree
This page was built for publication: Degree bipartite Ramsey numbers