Size Ramsey results for the path of order three
From MaRDI portal
Publication:2053695
DOI10.1007/S00373-021-02398-3zbMATH Open1479.05221OpenAlexW3210893148MaRDI QIDQ2053695FDOQ2053695
Authors: Roland Lortz, Ingrid Mengersen 
Publication date: 30 November 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-021-02398-3
Recommendations
- On the restricted size Ramsey number involving a path \(P_3\)
- Restricted size Ramsey number for path of order three versus graph of order five
- Restricted size Ramsey number for P3 versus dense connected graphs of order six
- scientific article; zbMATH DE number 1229599
- Upper bounds for the size Ramsey numbers for \(P_3\) versus \(C^t_3\) or \(P_n\)
Cites Work
- The size Ramsey number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Ramsey numbers for graphs with five vertices
- Some small ramsey numbers
- Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
- Title not available (Why is that?)
- R(4, 5) = 25
- Size Ramsey numbers for small‐order graphs
- Size Ramsey numbers involving stars
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-edge colorings of graphs with bounded degree in both colors
- The ramsey number r(k1 + c4, k5 − e)
- Title not available (Why is that?)
- Restricted size Ramsey number for path of order three versus graph of order five
- Computation of the Ramsey number \(R(W_5,K_5)\)
Cited In (4)
- Restricted size Ramsey number for path of order three versus graph of order five
- Upper bounds for the size Ramsey numbers for \(P_3\) versus \(C^t_3\) or \(P_n\)
- Restricted size Ramsey number for P3 versus dense connected graphs of order six
- On the restricted size Ramsey number involving a path \(P_3\)
This page was built for publication: Size Ramsey results for the path of order three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053695)
