No phase transition for the lower-tail variational problem of bipartite graphs
No phase transition for the lower-tail variational problem of bipartite graphs
For , let be the problem of minimizing over graphons subject to , where is the rate function and is the homomorphism density. Bipartite lower-tail conjecture. If is bipartite, then the constant graphon is always the unique minimizer of .
The conjecture holds for every bipartite graph satisfying Sidorenko's conjecture, but may hold more generally. Its status is not resolved by the supplied text.
Sources & referencesView supporting material
Primary source
Yufei Zhao, “On the lower tail variational problem for random graphs”, arXiv:1502.00867 (2015).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.