Prohlížení Publikační činnost ČVUT dle předmětu "Extremal graph theory"

Zobrazují se záznamy 1-2 z 2

    • Cycles of a given length in tournaments 

      Autor: Grzesik A.; Král' D.; Lovász L.M.; Volec J.
      (Elsevier B.V., 2023)

    • 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 ...