8 citations · 27 across the 30 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.CO2022
Quasirandom forcing orientations of cycles
Andrzej Grzesik, Daniel Il'kovič, Bartłomiej Kielak +1
An oriented graph is quasirandom-forcing if the limit (homomorphism) density of in a sequence of tournaments is if and only if the sequence is quasirandom. We…
math.CO2022
Graphs without a rainbow path of length 3
Sebastian Babiński, Andrzej Grzesik
In 1959 Erdős and Gallai proved the asymptotically optimal bound for the maximum number of edges in graphs not containing a path of a fixed length. Here we study a rainbow version…
math.CO2022
Subgraph densities in -free graphs
Andrzej Grzesik, Ervin Győri, Nika Salia +1
In this paper we disprove a conjecture of Lidický and Murphy about the number of copies of a given graph in a -free graph and give an alternative general conjecture. We also p…