10 citations · 19 across the 14 of their papers we have counts for
4 papers · 1 filter
Making -Free Graphs -partite
József Balogh, Felix Christian Clemen, Mikhail Lavrov +2
The Erdős-Simonovits stability theorem states that for all ε>0 there exists α>0 such that if G is a K_{r+1}-free graph on n vertices with e(G) > ex(n,K_{r+1}) - αn^2, then one can…
Monochromatic paths and cycles in -edge-colored graphs with large minimum degree
József Balogh, Alexandr Kostochka, Mikhail Lavrov +1
A graph arrows a graph if in every -edge-coloring of there exists a monochromatic copy of . Schelp had the idea that if the complete graph arrows a small gr…
Long monochromatic paths and cycles in 2-edge-colored multipartite graphs
József Balogh, Alexandr Kostochka, Mikhail Lavrov +1
We solve four similar problems: For every fixed and large , we describe all values of such that for every -edge-coloring of the complete -partite grap…
Monochromatic connected matchings in 2-edge-colored multipartite graphs
József Balogh, Alexandr Kostochka, Mikhail Lavrov +1
A matching in a graph is connected if all the edges of are in the same component of . Following Łuczak,there have been many results using the existence of large conn…