Generalized quasirandom graphs-Reference-Cited by-同舟云学术

Generalized quasirandom graphs

Published:2008-01 Issue:1 Volume:98 Page:146-163
ISSN:0095-8956
Container-title:Journal of Combinatorial Theory, Series B
language:en
Short-container-title:Journal of Combinatorial Theory, Series B

Author:

Lovász László,Sós Vera T.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference10 articles.

1. Counting graph homomorphisms;Borgs,2006

2. C. Borgs, J. Chayes, L. Lovász, V.T. Sós, K. Vesztergombi, Convergent graph sequences I: Subgraph frequencies, metric properties, and testing; Convergent graph sequences II: Multiway cuts and statistical physics, Manuscript

3. Quasi-random graphs;Chung;Combinatorica,1989

4. Reflection positivity, rank connectivity, and homomorphisms of graphs;Freedman;J. Amer. Math. Soc.,2007

5. The rank of connection matrices and the dimension of graph algebras;Lovász;European J. Combin.,2006

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

1. Efficient polynomial-time approximation scheme for the genus of dense graphs;Journal of the ACM;2024-09-03

2. Forcing generalised quasirandom graphs efficiently;Combinatorics, Probability and Computing;2023-09-05

3. Monotone Arithmetic Complexity of Graph Homomorphism Polynomials;Algorithmica;2023-03-11

4. Forcing Generalized Quasirandom Graphs Efficiently;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023

5. On a question of Vera T. Sós about size forcing of graphons;Acta Mathematica Hungarica;2022-10