On mixed Ramsey numbers (Q5906405)

The linear arboricity of a graph \(G\) is the least integer \(m\) such that the vertex set \(V(G)\) can be partitioned into \(m\) sets, each inducing a linear forest, i.e. a forest in which every component is a path. Let \(H\) be a connected graph on \(n\) vertices such that \(V(H)\) can be covered by \(t\) (and no fewer) vertex-disjoint paths in the complement \(\overline H\). It is proved that every graph \(G\) with linear arboricity \(m\) such that \(\overline G\) does not have \(H\) as a subgraph has at most \((n+t-2)m\) vertices and this is sharp.