Encores on cores.
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cain, Julie, Wormald, Nicholas (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lagerås, Andreas N., Lindholm, Mathias (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Behrisch, Michael (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kunal Dutta, C.R. Subramanian (2014)
Discussiones Mathematicae Graph Theory
Similarity:
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 surely (a.a.s.) one of only 2 possible values, namely either b*or b* + 1, where b* = ⌊2(logrn) + 0.5⌋ and r = p−1. It is also shown that if, asymptotically, 2(logrn) + 1 is not within a distance...
Friedrich, Tobias, Sauerwald, Thomas (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bloznelis, Mindaugas (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Angelopoulos, Spyros, Doerr, Benjamin, Huber, Anna, Panagiotou, Konstantinos (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Duckworth, W. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Janson, Svante (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Fox, Jacob, Sudakov, Benny (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Deijfen, Maria, Jonasson, Johan (2006)
Electronic Communications in Probability [electronic only]
Similarity:
Donato, Debora, Laura, Luigi, Leonardi, Stefano, Meyer, Ulrich, Millozzi, Stefano, Sibeyn, Jop F. (2006)
Journal of Graph Algorithms and Applications
Similarity:
Pons, Pascal, Latapy, Matthieu (2006)
Journal of Graph Algorithms and Applications
Similarity: