Katona O.H. Gyula: The maximum number of edges of a graph wthout a long path and large clique

Abstract:
We try to determine the largest number of edges of a graph on n vertices
which contains neither a path on k vertices nor a clique on m vertices
(m<k). We can determine this maximum for large n if either 2m-1<k or m<k
but the additonal conditon holds that the graph is connected.

Joint work with Chuanqi Xiao.

You can also join the meeting in Zoom:
https://zoom.us/j/98309652873?pwd=TkdlNXNRdkZYcHlnRnN3OHhUWkZmQT09
Passcode: 073424