Cargando…
Graph limits of random graphs from a subset of connected k‐trees
For any set Ω of non‐negative integers such that [Formula: see text] , we consider a random Ω‐k‐tree G (n,k) that is uniformly selected from all connected k‐trees of (n + k) vertices such that the number of (k + 1)‐cliques that contain any fixed k‐clique belongs to Ω. We prove that G(n,k), scaled by...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
John Wiley & Sons, Inc.
2018
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6686707/ https://www.ncbi.nlm.nih.gov/pubmed/31423073 http://dx.doi.org/10.1002/rsa.20802 |