Csóka, Endre (2016) On the graph limit question of Vera T. Sos. JOURNAL OF COMBINATORIAL THEORY SERIES B, 116. pp. 306-311. ISSN 0095-8956
![[img]](http://real.mtak.hu/style/images/fileicons/text.png) |
Text
1_s2.0_S0095895615001100_main_u.pdf - Published Version Restricted to Registered users only Download (229kB) | Request a copy |
|
|
Text
44208.pdf - Submitted Version Download (92kB) | Preview |
Official URL: http://dx.doi.org/10.1016/j.jctb.2015.09.003
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. Sos 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. (C) 2015 Elsevier Inc. All rights reserved.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Graph limits; QUASI-RANDOM GRAPHS; Graph homomorphisms |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 03 Jan 2017 14:26 |
| Last Modified: | 09 Jan 2017 08:11 |
| URI: | http://real.mtak.hu/id/eprint/44208 |
Actions (login required)
 |
Edit Item |
