Letnji semestar 2022. / Summer semester 2022 13/05/2022 Turán (1941) found the maximum number of edges in an n-vertex graph containing no complete graph on m vertices. On the other hand Erdős and Gallai determined the maximum number of edges if the graph contains no path of length k. Here we combine these two conditions and give a partial answer for the maximum number of edges. Joint work with Chuanqi Xiao. |