Now showing items 1-2 of 2

    • Non-Bipartite K-Common Graphs 

      Author: Kráľ D.; Noel J.A.; Norin S.; Volec J.; Wei F.
      (Akadémiai Kiadó, 2022)
      In this work, we construct the first examples of non-bipartite k-common graphs for k at least 3, which resolves a problem of Jagger, Stovícek and Thomason from 1996. A graph H is said to be "k-common" if the number of ...
    • Toward characterizing locally common graphs 

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