Now showing items 1-2 of 2

    • Large Multipartite Subgraphs in H-free Graphs 

      Author: 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 ...
    • No additional tournaments are quasirandom-forcing 

      Author: Hancock R.; Kabela A.; Kraľ D.; Martins T.; Parente R.; Skerman F.; Volec J.
      (Elsevier, 2023)
      A tournament H is quasirandom-forcing if the following holds for every sequence (G_n) is an element of N of tournaments of growing orders: if the density of H in G_n converges to the expected density of H in a random ...