• Large Multipartite Subgraphs in H-free Graphs 

      Autor: Hu P.; Lidický B.; Martins T.; Norin S.; Volec J.
      (Springer Nature Switzerland AG, 2021)
      In this work, we discuss a strengthening of a result of Füredi that every n-vertex K_{r+1}-free graph can be made r-partite by removing at most T(n, r) - e(G) edges, where T(n,r)=(r-1)/(2r) * n^2 denotes the number of edges ...