Size Ramsey results for the path of order three
From MaRDI portal
Publication:2053695
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
- scientific article; zbMATH DE number 426333 (Why is no real title available?)
- scientific article; zbMATH DE number 3867376 (Why is no real title available?)
- scientific article; zbMATH DE number 1229599 (Why is no real title available?)
- scientific article; zbMATH DE number 1943962 (Why is no real title available?)
- scientific article; zbMATH DE number 2114474 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- R(4, 5) = 25
- Computation of the Ramsey number \(R(W_5,K_5)\)
- Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
- Ramsey numbers for graphs with five vertices
- Restricted size Ramsey number for path of order three versus graph of order five
- Size Ramsey numbers for small‐order graphs
- Size Ramsey numbers involving stars
- Some small ramsey numbers
- The ramsey number r(k1 + c4, k5 − e)
- The size Ramsey number
- Two-edge colorings of graphs with bounded degree in both colors
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)