On the order and the number of cliques in a random graph
Daniel Olejár, Eduard Toman (1997)
Mathematica Slovaca
Similarity:
Displaying similar documents to “On the cover time of planar graphs.”
On the order and the number of cliques in a random graph
Recurrence of distributional limits of finite planar graphs.
Benjamini, Itai, Schramm, Oded (2001)
Electronic Journal of Probability [electronic only]
Similarity:
Entrywise bounds for eigenvectors of random graphs.
Mitra, Pradipta (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bipartite coverings and the chromatic number.
Mubayi, Dhruv, Vishwanathan, Sundar (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multicoloured Hamilton cycles in random graphs; an anti-Ramsey threshold.
Cooper, Colin, Frieze, Alan (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Chromatic number for a generalization of Cartesian product graphs.
Král', Daniel, West, Douglas B. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Threshold functions for the bipartite Turán property.
Godbole, Anant P., Lamorte, Ben, Sandquist, Erik Jonathan (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the chromatic number of simple triangle-free triple systems.
Frieze, Alan, Mubayi, Dhruv (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Approximations of weighted independent set and hereditary subset problems.
Halldórsson, Magnús M. (2000)
Journal of Graph Algorithms and Applications
Similarity:
Guessing secrets.
Chung, Fan, Graham, Ronald, Leighton, Tom (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Random walks on finite groups with few random generators.
Pak, Igor (1999)
Electronic Journal of Probability [electronic only]
Similarity: