= Alexander Sidorenko
{c}
<Alexander Sidorenko> works on density inequalities in <graph theory> and the theory of <hypergraphs>. His name is associated with the <Sidorenko conjecture>, which compares copies of a fixed <bipartite graph> with the random-density benchmark.<Extremal numbers and Sidorenko’s conjecture by David Conlon and others>[Introduction and original references]{ref}
With <David Conlon> and <Joonkyung Lee>, he studied hypergraph failures of the analogous inequality. Their result turns such failures into improved extremal constructions, connecting analytic inequalities for densities with concrete forbidden-subgraph problems.<Extremal numbers and Sidorenko’s conjecture by David Conlon and others>[Abstract and introduction]{ref}
Back to article page
