Stability results in graphs of given circumference
Stability results in graphs of given circumference

Jie Ma , University of Science and Technology of China
Fine Hall 224
In this talk we will discuss some Turantype results on graphs with a given circumference. Let W_{n,k,c} be the graph obtained from a clique K_{ck+1} by adding n(ck+1) isolated vertices each joined to the same k vertices of the clique, and let f(n,k,c)=e(W_{n,k,c}). Improving the ErdosGallai theorem, Kopylov proved in 1977 that for c