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 sho...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_ca |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1807/31311 |