test Browse by Author Names Browse by Titles of Works Browse by Subjects of Works Browse by Issue Dates of Works
       

Advanced Search
Home   
 
Browse   
Communities
& Collections
  
Issue Date   
Author   
Title   
Subject   
 
Sign on to:   
Receive email
updates
  
My Account
authorized users
  
Edit Profile   
 
Help   
About T-Space   

T-Space at The University of Toronto Libraries >
School of Graduate Studies - Theses >
Master >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1807/31311

Title: On the Logarithimic Calculus and Sidorenko's Conjecture
Authors: Li, Xiang
Advisor: Szegedy, Balazs
Department: Mathematics
Keywords: Combinatorics
Probability
Issue Date: 14-Dec-2011
Abstract: 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.
URI: http://hdl.handle.net/1807/31311
Appears in Collections:Master

Files in This Item:

File Description SizeFormat
Li_Xiang_201111_MSc_thesis.pdf203.19 kBAdobe PDF
View/Open

Items in T-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

uoft