Jan Volec

works on

extremal graph theory 1 flag algebras 1 homomorphism density 1 maximum degree 1 pentagon counting 1 quasirandom forcing 1 regular tournaments 1 sidorenko property 1 tournaments 1 triangle-free graphs 1

From the 2 of 4 linked papers with an AI index.

collaborators

4 papers

math.CO2026

Strong edge-colouring via local flag algebras

Eoin Davey, Eoin Hurley, RÃ©mi de Joannis de Verclos +2

The strong chromatic index $I ¨ _{s}^{'} (G)$ is the smallest number of colours needed to colour the edges of a graph $G$ so that any two edges at distance at most $2$ receive different co…

math.CO2026

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…

math.CO2026

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…

math.CO2026

Semi-Inducibility of some small graphs

JÃ³zsef Balogh, Bernard LidickÃ½, Dhruv Mubayi +2

Let $H$ be a fixed graph whose edges are colored red and blue and let $I^^{2} \in [0, 1]$ . Let $I (H, I^^{2})$ be the (asymptotically normalized) maximum number of copies of $H$ in a large re…