A note on the non-colorability threshold of a random graph.
Kaporis, Alexis C., Kirousis, Lefteris M., Stamatiou, Yannis C. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Random subgraphs of certain graph powers.”
A note on the non-colorability threshold of a random graph.
Graphs with many copies of a given subgraph.
Nikiforov, Vladimir (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A note on odd cycle-complete graph Ramsey numbers.
Sudakov, Benny (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Finding induced acyclic subgraphs in random digraphs.
Subramanian, C.R. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The -stability number of a random graph.
Fountoulakis, Nikolaos, Kang, Ross J., McDiarmid, Colin (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Component evolution in random intersection graphs.
Behrisch, Michael (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Planarity thresholds for two types of random subgraphs of the -cube
Karin Mahrhold, Karl F. E. Weber (1989)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Holes in graphs.
Peng, Yuejian, Rödl, Vojtech, Ruciński, Andrzej (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rank numbers for bent ladders
Peter Richter, Emily Leven, Anh Tran, Bryan Ek, Jobby Jacob, Darren A. Narayan (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A ranking on a graph is an assignment of positive integers to its vertices such that any path between two vertices with the same label contains a vertex with a larger label. The rank number of a graph is the fewest number of labels that can be used in a ranking. The rank number of a graph is known for many families, including the ladder graph P2 × Pn. We consider how ”bending” a ladder affects the rank number. We prove that in certain cases the rank number does not change, and in others...
Random -sat: the limiting probability for satisfiability for moderately growing .
Coja-Oghlan, Amin, Frieze, Alan (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On percolation in random graphs with given vertex degrees.
Janson, Svante (2009)
Electronic Journal of Probability [electronic only]
Similarity: