Prohlížení Publikační činnost ČVUT dle autora "Hancock R."

Zobrazují se záznamy 1-2 z 2

    • No additional tournaments are quasirandom-forcing 

      Autor: 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 ...

    • Toward characterizing locally common graphs 

      Autor: Hancock R.; Kráľ D.; Krnc M.; Volec J.
      (John Wiley & Sons, Ltd., 2023)
      A graph H is common if the number of monochromatic copies of H in a 2-edge-coloring of the complete graph is asymptotically minimized by the random coloring. The classification of common graphs is one of the most intriguing ...