2 papers
math.CO2005
Pseudo-random graphs
Michael Krivelevich, Benny Sudakov
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject…
math.CO2003
List colouring of graphs with at most vertices
Bruce Reed, Benny Sudakov
Ohba has conjectured \cite{ohb} that if the graph has or fewer vertices then the list chromatic number and chromatic number of are equal. In this paper we prove t…