Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 21, 2019 | Submitted
Report Open

Sidorenko's conjecture for higher tree decompositions


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.

Additional Information

Conlon research supported by a Royal Society University Research Fellowship. Kim was supported by the National Research Foundation of Korea (NRF) Grant funded by the Korean Government (MSIP) (NRF-2012R1A2A2A01018585) and KIAS internal Research Fund CG046001. C. Lee research supported by NSF Grant DMS-1362326. J. Lee supported by ILJU Foundation of Education and Culture.

Attached Files

Submitted - 1805.02238.pdf


Files (279.9 kB)
Name Size Download all
279.9 kB Preview Download

Additional details

August 19, 2023
October 18, 2023