35 citations · 160 across the 27 of their papers we have counts for
34 papers
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…
Strong edge-colouring via local flag algebras
Eoin Davey, Eoin Hurley, Rémi de Joannis de Verclos +2
The strong chromatic index is the smallest number of colours needed to colour the edges of a graph so that any two edges at distance at most receive different col…
Local flag algebras
Eoin Davey, Eoin Hurley, Rémi de Joannis de Verclos +2
We introduce local flag algebras, a variant of Razborov's flag algebra framework in which densities are normalised by the maximum degree rather than the order . The fra…
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/…
Common graphs with arbitrary chromatic number
Daniel Kral, Jan Volec, Fan Wei
Ramsey's Theorem guarantees for every graph H that any 2-edge-coloring of a sufficiently large complete graph contains a monochromatic copy of H. In 1962, Erdos conjectured that th…