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.[ref]
Extremal numbers and Sidorenko’s conjecture by David Conlon and others. Introduction and original references
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.[ref]
New to topics? Read the docs here!