From the 2 of 6 linked papers with an AI index.
6 papers · 1 filter
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 co…
Local flag algebras
Eoin Davey, Eoin Hurley, Rémi de Joannis de Verclos +2
The paper introduces local flag algebras, a variant of Razborov's flag algebra method that normalizes graph densities by the maximum degree instead of the number of vertices, and u…
Sidorenko property and forcing in regular tournaments
Daniel Král', Matjaž Krnc, Filip KuÄerák +2
The paper fully characterizes which tournaments have the Sidorenko property for nearly regular tournaments, showing that a random tournament minimizes homomorphism density, and res…
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 re…
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…
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…