On the logarithimic calculus and Sidorenko's conjecture

Details On the logarithimic calculus and Sidorenko's conjecture On the logarithimic calculus and Sidorenko's conjecture

2011-07-06

arxiv.org/abs/1107.1153v1

Mathematics

Combinatorics

Scientific paper

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 Erd\"os-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.

Affiliated with

Also associated with

No associations

Rating

On the logarithimic calculus and Sidorenko's conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the logarithimic calculus and Sidorenko's conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the logarithimic calculus and Sidorenko's conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-678610