
In the dense graph limit theory, the topology of the set of graphs is defined by the distribution of the subgraphs spanned by finite number of random vertices. Vera T. Sós proposed a question that if we consider only the number of edges in the spanned subgraphs, then whether it provides an equivalent definition. We show that the answer is positive on quasirandom graphs, and we prove a generalization of the statement.
4 pages
QA Mathematics / matematika, Random graphs (graph-theoretic aspects), graph homomorphisms, QA166-QA166.245 Graphs theory / gráfelmélet, Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), quasi-random graphs, FOS: Mathematics, Mathematics - Combinatorics, Density (toughness, etc.), Combinatorics (math.CO), graph limits
QA Mathematics / matematika, Random graphs (graph-theoretic aspects), graph homomorphisms, QA166-QA166.245 Graphs theory / gráfelmélet, Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.), quasi-random graphs, FOS: Mathematics, Mathematics - Combinatorics, Density (toughness, etc.), Combinatorics (math.CO), graph limits
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
