Asymptotic properties of some minor-closed classes of graphs (conference version)
Let $\mathcal{A}$ be a minor-closed class of labelled graphs, and let $G_n$ be a random graph sampled uniformly from the set of n-vertex graphs of $\mathcal{A}$. When $n$ is large, what is the probability that $G_n$ is connected? How many components does it have? How large is its biggest component?...
में बचाया:
| मुख्य लेखकों: | , |
|---|---|
| स्वरूप: | Artigo |
| भाषा: | Inglês |
| प्रकाशित: |
Discrete Mathematics & Theoretical Computer Science
2013-01-01
|
| श्रृंखला: | Discrete Mathematics & Theoretical Computer Science |
| विषय: | |
| ऑनलाइन पहुंच: | https://dmtcs.episciences.org/2327/pdf |
| टैग: |
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|