Pages that link to "Item:Q5202213"

The following pages link to An upper bound on the ramsey number <i>R</i>(<i>K</i>₃, <i>G</i>) depending only on the size of the graph <i>G</i> (Q5202213):

Displaying 7 items.

• A Ramsey problem of Harary on graphs with prescribed size (Q1092061) (← links)
• The smallest Ramsey numbers (Q1297442) (← links)
• An upper bound for the Ramsey numbers \(r(K_ 3,G)\) (Q1322269) (← links)
• The Ramsey number of an \(n\)-edge graph versus triangle is at most \(2n+1\) (Q1325260) (← links)
• An improved upper bound for Ramsey number \(R(3,3,3,3;2)\) (Q1893181) (← links)
• A note on Ramsey size-linear graphs (Q2778280) (← links)
• The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i>²/log <i>t</i> (Q4851927) (← links)