pith. sign in

arxiv: 1107.1153 · v1 · pith:KSCBCVLEnew · submitted 2011-07-06 · 🧮 math.CO

On the logarithimic calculus and Sidorenko's conjecture

J.L. Xiang Li , Balazs Szegedy This is my paper
classification 🧮 math.CO
keywords conjecturecalculusgraphssidorenkoanalyticbipartitecompleteconlon
0
0 comments X
read the original 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 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Tensor Amplification and Spectral Transfer for Sidorenko-Type Inequalities

    math.CO 2026-07 unverdicted novelty 6.0

    Tensor-amplification framework proves equality regularization and spectral equivalence for C-Sidorenko graphs in admissible graphon classes.

  2. Mathematical exploration and discovery at scale

    cs.NE 2025-11 unverdicted novelty 6.0

    AlphaEvolve rediscovered best-known solutions for most of 67 tested math problems and found improved solutions in several cases using LLM-guided evolutionary search.