Sidorenko's conjecture for higher tree decompositions
Combinatorics
2018-05-08 v1
Abstract
This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader class, comparable to that given in work of Szegedy, through further iteration.
Cite
@article{arxiv.1805.02238,
title = {Sidorenko's conjecture for higher tree decompositions},
author = {David Conlon and Jeong Han Kim and Choongbum Lee and Joonkyung Lee},
journal= {arXiv preprint arXiv:1805.02238},
year = {2018}
}
Comments
7 pages, unpublished note