Füredi Zoltán (Rényi): Zykov's symmetrization for multiple graphs, a new tool for Turán type problems with an application to Erdős' conjecture on pentagonal edges |
|
|
|
|
Friday, 24. April 2015, 10:40 - 12:00
|
|
| Abstract. Erd\H{o}s, Faudree, and Rousseau (1992) showed that a graph on $n$ vertices and at least $\lfloor n^2/4\rfloor+1$ edges has at least $2\lfloor n/2\rfloor+1$ edges on triangles. This result is sharp, just add an extra edge to the complete bipartite graph. In this talk, we give an asymptotic formula for the minimum number of edges contained on triangles in a graph having $n$ vertices and $e$ edges. |
|
Location : Riesz terem |
Back
JEvents v3.1.8 Stable
Copyright © 2006-2013
Export Event