Buscar
Mostrando ítems 1-2 de 2
Ponencia
Phase transitions in the Ramsey-Turán theory
(2013)
Let f(n) be a function and L be a graph. Denote by RT(n, L, f(n)) the maximum number of edges of an L-free graph on n vertices with independence number less than f(n). Erdos and Sós asked if RT (n, K5, c√ n) = o (n2) for ...
Ponencia
Empty convex polytopes in random point sets
(2013)
Given a set P of points in Rd, a convex hole (alternatively, empty convex polytope) of P is a convex polytope with vertices in P, containing no points of P in its interior. Let R be a bounded convex region in Rd. We show ...