Step Sidorenko property and non-norming edge-transitive graphs
Combinatorics Seminar
29th May 2018, 12:00 pm – 1:00 pm
Howard House, 2nd Floor Seminar Room
A graph H has the step Sidorenko property if a quasirandom multipartite graph minimizes the density of H among all graphs with the same edge densities between its parts. We show that many bipartite graphs fail to have the step Sidorenko property and use our results to show the existence of a family of bipartite edge-transitive graphs that are not weakly norming, answering a question of Hatami [Israel J. Math. 175 (2010), 125–150]. This is a joint work with Dan Kral, Peter Pal Pach and Marcin Wrochna.
Comments are closed.