Induced Acyclic Tournaments in Random Digraphs: Sharp Concentration, Thresholds and Algorithms
Given a simple directed graph D = (V,A), let the size of the largest induced acyclic tournament be denoted by mat(D). Let D ∈ D(n, p) (with p = p(n)) be a random instance, obtained by randomly orienting each edge of a random graph drawn from Ϟ(n, 2p). We show that mat(D) is asymptotically almost sur...
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Makale |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
University of Zielona Góra
2014-08-01
|
| Seri Bilgileri: | Discussiones Mathematicae Graph Theory |
| Konular: | |
| Online Erişim: | https://doi.org/10.7151/dmgt.1758 |