35 citations · 160 across the 27 of their papers we have counts for
3 papers · 2 filters
On tripartite common graphs
Andrzej Grzesik, Joonkyung Lee, Bernard Lidický +1
A graph H is common if the number of monochromatic copies of H in a 2-edge-colouring of the complete graph is minimised by the random colouring. Burr and Rosta, extending a famous…
Cycles of a given length in tournaments
Andrzej Grzesik, Daniel Kral, Laszlo Miklos Lovasz +1
We study the asymptotic behavior of the maximum number of directed cycles of a given length in a tournament: let be the limit of the ratio of the maximum number of cycles…
Non-bipartite k-common graphs
Daniel Kral, Jonathan A. Noel, Sergey Norin +2
A graph H is k-common if the number of monochromatic copies of H in a k-edge-coloring of K_n is asymptotically minimized by a random coloring. For every k, we construct a connected…