CaltechAUTHORS
Published May 6, 2018 | Version Submitted
Discussion Paper Open

Sidorenko's conjecture for higher tree decompositions

Creators

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.

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

1805.02238.pdf

Files (279.9 kB)

Name Size
md5:fd1ada56b50dc8de9f5a836a7d5de677
279.9 kB Preview Download

Additional details

Identifiers

Eprint ID
98054
Resolver ID
CaltechAUTHORS:20190820-161459631

Related works

Describes
https://arxiv.org/abs/1805.02238 (URL)
http://resolver.caltech.edu/CaltechAUTHORS:20190812-162958339 (URL)

Funding

Royal Society
National Research Foundation of Korea
NRF-2012R1A2A2A01018585
Korea Institute for Advanced Study
CG046001
NSF
DMS-1362326
ILJU Foundation of Education and Culture

Dates

Created
2019-08-21
Created from EPrint's datestamp field
Updated
2019-10-03
Created from EPrint's last_modified field

Caltech Custom Metadata

Caltech groups
Mathematics Department