लोड हो रहा है...
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...
में बचाया:
| में प्रकाशित: | Random Struct Algorithms |
|---|---|
| मुख्य लेखकों: | , , |
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
John Wiley & Sons, Inc.
2018
|
| विषय: | |
| ऑनलाइन पहुंच: | https://ncbi.nlm.nih.gov/pmc/articles/PMC6686707/ https://ncbi.nlm.nih.gov/pubmed/31423073 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1002/rsa.20802 |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|