Return to search

On the Logarithimic Calculus and Sidorenko's Conjecture

We study a type of calculus for proving inequalities between subgraph densities which is based on Jensen's inequality for the logarithmic function. As a demonstration of the method we verify the conjecture of Erdos-Simonovits and Sidorenko for new families of graphs. In particular we give a short analytic proof for a result by Conlon, Fox and Sudakov. Using this, we prove the forcing conjecture for bipartite graphs in which one vertex is complete to the other side.

Identiferoai:union.ndltd.org:TORONTO/oai:tspace.library.utoronto.ca:1807/31311
Date14 December 2011
CreatorsLi, Xiang
ContributorsSzegedy, Balazs
Source SetsUniversity of Toronto
Languageen_ca
Detected LanguageEnglish
TypeThesis

Page generated in 0.0019 seconds