Size Ramsey results for the path of order three

DOI10.1007/S00373-021-02398-3MaRDI QIDQ2053695zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

almost complete graphpathrestricted size Ramsey numbersize Ramsey numbersmall graphstar

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

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₃ versus C^t₃ or P_n

Cites work

• R(4, 5) = 25
• Computation of the Ramsey number R(W₅,K₅)
• Generalized Ramsey theory for graphs. III: Small off-diagonal numbers
• 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?)
• 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(k₁ + c₄, k₅ − e)
• The size Ramsey number
• Two-edge colorings of graphs with bounded degree in both colors

Cited in

(5)

• 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
• Upper bounds for the size Ramsey numbers for P₃ versus C^t₃ or P_n
• Restricted size Ramsey number for P3 versus dense connected graphs of order six
• Matching-star size Ramsey numbers under connectivity constraint

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)