8 citations · 27 across the 30 of their papers we have counts for
5 papers · 1 filter
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…
On the inducibility of oriented graphs on four vertices
Łukasz Bożyk, Andrzej Grzesik, Bartłomiej Kielak
We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for mor…
Exact hyperplane covers for subsets of the hypercube
James Aaronson, Carla Groenland, Andrzej Grzesik +2
Alon and Füredi (1993) showed that the number of hyperplanes required to cover without covering is . We initiate the study of such exact hyperplan…
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…
Covering minimal separators and potential maximal cliques in -free graphs
Andrzej Grzesik, Tereza Klimošová, Marcin Pilipczuk +1
A graph is called -free} if it does not contain a -vertex path as an induced subgraph. While -free graphs are exactly cographs, the structure of -free graphs for…