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?...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Discrete Mathematics & Theoretical Computer Science
2013-01-01
|
| Seri Bilgileri: | Discrete Mathematics & Theoretical Computer Science |
| Konular: | |
| Online Erişim: | https://dmtcs.episciences.org/2327/pdf |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|