Запись доклада István Tomon String graphs have the ErdösHajnal property Слайды: Аннотация: A string graph is the intersection graph of curves in the plane. Building on previous works of Fox and Pach, we prove that there exists an absolute constant c 0 such that if G is a string graph on n vertices, then G contains either a clique or an independent set of size at least nc.
0
0
Related videos
Preparing
To view the site materials you should be more than or equal to 18 years old