On October 8, 2019, Prof. Alexandr V. Kostochka from the University of Illinois at Urbana-Champaign gave a colloquium talk at the KAIST Mathematical Sciences – IBS Discrete Mathematics Group Joint Colloquium. The title of his talk was “On Ramsey-type problems for paths and cycles in dense graphs“. He will stay one week at IBS Discrete Mathematics Group.
A graph or graph property is -reconstructible if it is determined by the multiset of all subgraphs obtained by deleting vertices. Apart from the famous Graph Reconstruction Conjecture, Kelly conjectured in 1957 that for each , there is an integer such that every graph with at least vertices is -reconstructible.
We show that for each and every -vertex graph , the degree list and connectedness of are -reconstructible, and the threshold is sharp for both properties. We also show that all -regular graphs are -reconstructible.
A well-known Ramsey-type puzzle for children is to prove that among any 6 people either there are 3 who know each other or there are 3 who do not know each other. More generally, a graph arrows a graph if for any coloring of the edges of with two colors, there is a monochromatic copy of . In these terms, the above puzzle claims that the complete -vertex graph arrows the complete -vertex graph .
We consider sufficient conditions on the dense host graphs to arrow long paths and even cycles. In particular, for large we describe all multipartite graphs that arrow paths and cycles with edges. This implies a conjecture by Gyárfás, Ruszinkó, Sárkőzy and Szemerédi from 2007 for such . Also for large we find which minimum degree in a -vertex graph guarantees that arrows the -vertex path. This yields a more recent conjecture of Schelp.
This is joint work with Jozsef Balogh, Mikhail Lavrov and Xujun Liu.
