Some advances on Sidorenko's conjecture
Top Cited Papers
- 27 June 2018
- journal article
- research article
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 98 (3) , 593-608
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- European Research Council (676632)
- National Research Foundation of Korea (NRF‐2016R1A5A1008055)
- National Science Foundation (DMS‐1362326)
This publication has 9 references indexed in Scilit:
- Combinatorial theorems in sparse random setsAnnals of Mathematics, 2016
- Two approaches to Sidorenko’s conjectureTransactions of the American Mathematical Society, 2015
- Counting odd cycles in locally dense graphsJournal of Combinatorial Theory, Series B, 2014
- Weak quasi‐randomness for uniform hypergraphsRandom Structures & Algorithms, 2011
- An Approximate Version of Sidorenko’s ConjectureGeometric and Functional Analysis, 2010
- Weak hypergraph regularity and linear hypergraphsJournal of Combinatorial Theory, Series B, 2010
- Graph norms and Sidorenko’s conjectureIsrael Journal of Mathematics, 2010
- Graph minors. III. Planar tree-widthJournal of Combinatorial Theory, Series B, 1984
- S-functions for graphsJournal of Geometry, 1976