On the Ramsey number of 4-cycle versus wheel
On the Ramsey number of 4-cycle versus wheel
<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p><span>For any fixed graphs $</span><span>G$ </span><span>and $</span><span>H$, </span><span>the Ramsey number $</span><span>R</span><span>(</span><span>G,H</span><span>)$ is the smallest positive integer $</span><span>n$ </span><span>such that for every graph $</span><span>F$ </span><span>on $</span><span>n$ </span><span>vertices must contain $</span><span>G$ </span><span>or the complement of $</span><span>F$ </span><span>contains $</span><span>H$. </span><span>The girth of graph $</span><span>G$ </span><span>is a length of …