Graph norms and Sidorenko’s conjecture-Reference-Cited by-同舟云学术

Graph norms and Sidorenko’s conjecture

Published:2010-01 Issue:1 Volume:175 Page:125-150
ISSN:0021-2172
Container-title:Israel Journal of Mathematics
language:en
Short-container-title:Isr. J. Math.

Author:

Hatami Hamed

Publisher

Springer Science and Business Media LLC

Subject

General Mathematics

Link

http://link.springer.com/content/pdf/10.1007/s11856-010-0005-1.pdf

Reference36 articles.

1. G. R. Blakley and R. Prabir, A Hölder type inequality for symmetric matrices with nonnegative entries, Proceedings of the American Mathematical Society 16 (1965), 1244–1245.

2. Algorithms Combinatorics;C. Borgs,2006

3. F. Chung, R. Graham and R. M. Wilson, Quasi-random graphs, Combinatorica 9 (1989), 345–362.

4. R. Daudel, R. Lefebvre and C. Moser, Quantum Chemistry: Methods and Applications, Interscience Publishers, New York-London, 1959.

5. Cambridge Studies in Advanced Mathematics;J. Diestel,1995

Cited by 61 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On uncommon systems of equations;Israel Journal of Mathematics;2024-08-04

2. Random homomorphisms into the orthogonality graph;Journal of Combinatorial Theory, Series B;2024-07

3. Explicit Separations between Randomized and Deterministic Number-on-Forehead Communication;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Left-Cut-Percolation and Induced-Sidorenko Bigraphs;SIAM Journal on Discrete Mathematics;2024-05-23