2 citations · 3 across the 11 of their papers we have counts for
4 papers · 1 filter
Maximizing in graphs with fixed edge density
József Balogh, Andrzej Grzesik, Bernard Lidický +3
For every integer , and , we asymptotically determine the maximum proportion of -element sets of vertices that induce either a clique or an independent set in…
Local maximum of inducibility profiles
József Balogh, Bernard Lidický, Haoran Luo
For a graph and , denote by the supremum of induced density of over -vertex graphs with edge density as goes to infinity. Liu, Mubayi and Re…
Sidorenko property and forcing in regular tournaments
Daniel Král', Matjaž Krnc, Filip Kučerák +2
We give a complete characterization of tournaments H that have the Sidorenko property with respect to nearly regular tournaments, i.e., the homomorphism density of H among all near…
Semi-Inducibility of some small graphs
József Balogh, Bernard Lidický, Dhruv Mubayi +2
Let be a fixed graph whose edges are colored red and blue and let . Let be the (asymptotically normalized) maximum number of copies of in a large red/…