On the bandwidth conjecture for 3-colourable graphs

Abstract

A conjecture by Bollob&#225;s and Koml&#243;s states that for every &#947; &gt; 0 and integers <i>r</i> &#8805; 2 and &#916;, there exists &#946; &gt; 0 such that for sufficiently large <i>n</i> the following holds: If <i>G</i> is a graph on <i>n</i> vertices with minimum degree at least (r-1/r+&#947;)<i>n</i> and <i>H</i> is an <i>r</i>-chromatic graph on… (More)

Topics

1 Figure or Table

Slides referencing similar topics