An upper bound on the ramsey number R(K3, G) depending only on the size of the graph G

DOI10.1002/JGT.3190150104MaRDI QIDQ5202213zbMATH OpenOpenAlexFDO

Authors Alexander Sidorenko

Publication date 1991

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190150104

zbMATH Keywords

Ramsey number

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Recommendations

• An upper bound for the Ramsey numbers \(r(K_ 3,G)\)
• scientific article; zbMATH DE number 4120201
• Upper bounds for the size Ramsey numbers for P₃ versus C^t₃ or P_n
• On bounds for size Ramsey numbers of a complete tripartite graph
• Upper bounds for ramsey numbers R(3, 3, ?, 3) and Schur numbers
• An improved upper bound for Ramsey number R(3,3,3,3;2)
• An adaptive upper bound on the Ramsey numbers R(3,,3)
• scientific article; zbMATH DE number 1109410
• On the restricted size Ramsey number for P₃ versus dense connected graphs
• New computational upper bounds for Ramsey numbers \(R(3,k)\)

Cited in

(11)

• A Ramsey problem of Harary on graphs with prescribed size
• The smallest Ramsey numbers
• An upper bound for the Ramsey numbers \(r(K_ 3,G)\)
• The Ramsey number of an n-edge graph versus triangle is at most 2n+1
• An improved upper bound for Ramsey number R(3,3,3,3;2)
• A note on Ramsey size-linear graphs
• scientific article; zbMATH DE number 4202303 (Why is no real title available?)
• Ramsey Numbers and the Size of Graphs
• scientific article; zbMATH DE number 749273 (Why is no real title available?)
• scientific article; zbMATH DE number 4120201 (Why is no real title available?)
• The Ramsey number R(3, t) has order of magnitude t²/log t

This page was built for publication: An upper bound on the ramsey number R(K₃, G) depending only on the size of the graph G

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202213)