Benny Sudakov

collaborators

Showing math.COShow all

2 papers · 1 filter

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 $(2 - o (1)) χ$ vertices

Bruce Reed, Benny Sudakov

Ohba has conjectured \cite{ohb} that if the graph $G$ has $2 χ (G) + 1$ or fewer vertices then the list chromatic number and chromatic number of $G$ are equal. In this paper we prove t…

Pseudo-random graphs

List colouring of graphs with at most (2−o(1))χ vertices

List colouring of graphs with at most $(2 - o (1)) χ$ vertices