The vertex size-Ramsey number
From MaRDI portal
Publication:267205
DOI10.1016/J.DISC.2016.02.001zbMATH Open1333.05195OpenAlexW2273961619MaRDI QIDQ267205FDOQ267205
Authors: Andrzej Dudek, Linda Lesniak
Publication date: 8 April 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.02.001
Recommendations
Cites Work
- Tree embeddings
- Expanding graphs contain all small trees
- The size Ramsey number
- A Ramsey type problem concerning vertex colourings
- Large bounded degree trees in expanding graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On size Ramsey number of paths, trees, and circuits. I
- The Induced Size-Ramsey Number of Cycles
- An alternative proof of the linearity of the size-Ramsey number of paths
- The size-Ramsey number of trees
- On size Ramsey numbers of graphs with bounded degree
- Sparse partition universal graphs for graphs of bounded degree
- Degree Ramsey numbers for cycles and blowups of trees
This page was built for publication: The vertex size-Ramsey number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q267205)