Stability of the path-path Ramsey number (Q1043993)

For graphs \(G_1, G_2, \dots, G_r\) the Ramsey number \(R(G_1, G_2, \dots, G_r)\) is the smallest positive integer \(n\) such that if the edges of a complete graph \(K_n\) are partitioned into \(r\) disjoint colour classes giving \(r\) graphs \(H_1, H_2, \dots, H_r\), then at least one \(H_i\), \(1\leq i\leq r\), contains a subgraph isomorphic to \(G_i\). A \(2\)-edge multicolouring \((G_1,G_2)\) of a graph \(G\) is a partition of the edges of \(G\) in such a way that the graphs \(G_1\) and \(G_2\) are not necessarily disjoint, i.e. an edge can obtain 2 colours. The paper contains a stability version of Ramsey-type Theorem for paths, that states that in any \(2\)-colouring of the edges of the complete graph \(K_n\) we can either find a monochromatic path longer that \(2n/3\) or the colouring is close to so-called extremal colouring (defined in terms of \(2\)-multicolouring).