Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.jctb.2015.09.003 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
Graph homomorphisms,Quasi-random graphs,Graph limits | Discrete mathematics,Graph,Combinatorics,Finite set,Vertex (geometry),Mathematics,Triangle-free graph,Split graph,Dense graph | Journal |
Volume | Issue | ISSN |
116 | C | 0095-8956 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Endre Csóka | 1 | 44 | 6.42 |