Conlon, David and Kim, Jeong Han and Lee, Choongbum and Lee, Joonkyung (2018) Sidorenko's conjecture for higher tree decompositions. . (Unpublished) https://resolver.caltech.edu/CaltechAUTHORS:20190820-161459631
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png) |
PDF
- Submitted Version
See Usage Policy. 273Kb |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20190820-161459631
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.
| Item Type: | Report or Paper (Discussion Paper) | ||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Related URLs: |
| ||||||||||||
| ORCID: |
| ||||||||||||
| 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. | ||||||||||||
| Funders: |
| ||||||||||||
| Record Number: | CaltechAUTHORS:20190820-161459631 | ||||||||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20190820-161459631 | ||||||||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||||||||
| ID Code: | 98054 | ||||||||||||
| Collection: | CaltechAUTHORS | ||||||||||||
| Deposited By: | Melissa Ray | ||||||||||||
| Deposited On: | 21 Aug 2019 20:23 | ||||||||||||
| Last Modified: | 03 Oct 2019 21:37 |
Repository Staff Only: item control page
