Paths of specified length in random -partite graphs.
Subramanian, C.R. (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Displaying similar documents to “Infinite paths and cliques in random graphs”
Paths of specified length in random -partite graphs.
The sizes of components in random circle graphs
Ramin Imany-Nabiyyi (2008)
Discussiones Mathematicae Graph Theory
Similarity:
We study random circle graphs which are generated by throwing n points (vertices) on the circle of unit circumference at random and joining them by an edge if the length of shorter arc between them is less than or equal to a given parameter d. We derive here some exact and asymptotic results on sizes (the numbers of vertices) of "typical" connected components for different ways of sampling them. By studying the joint distribution of the sizes of two components, we "go into" the structure...
A note on domination parameters in random graphs
Anthony Bonato, Changping Wang (2008)
Discussiones Mathematicae Graph Theory
Similarity:
Domination parameters in random graphs G(n,p), where p is a fixed real number in (0,1), are investigated. We show that with probability tending to 1 as n → ∞, the total and independent domination numbers concentrate on the domination number of G(n,p).
On pendant vertices in random graphs
Zbigniew Palka (1981)
Colloquium Mathematicae
Similarity:
Upper bounds on the non-3-colourability threshold of random graphs.
Fountoulakis, Nikolaos, McDiarmid, Colin (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Sharp threshold functions for random intersection graphs via a coupling method.
Rybarczyk, Katarzyna (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
First hitting times of simple random walks on graphs with congestion points.
Kang, Mihyun (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The Chromatic Number of Random Intersection Graphs
Katarzyna Rybarczyk (2017)
Discussiones Mathematicae Graph Theory
Similarity:
We study problems related to the chromatic number of a random intersection graph G (n,m, p). We introduce two new algorithms which colour G (n,m, p) with almost optimum number of colours with probability tending to 1 as n → ∞. Moreover we find a range of parameters for which the chromatic number of G (n,m, p) asymptotically equals its clique number.
On algorithmical testing tables of random numbers.
D. Banjevic, Z. Ivkovic (1979)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
On vertex, edge, and vertex-edge random graphs.
Beer, Elizabeth, Fill, James Allen, Janson, Svante, Scheinerman, Edward R. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the paradox of three random variables
S. Trybuła (1961)
Applicationes Mathematicae
Similarity:
On the paradox of n random variables
S. Trybuła (1965)
Applicationes Mathematicae
Similarity:
On exchangeable random variables and the statistics of large graphs and hypergraphs.
Austin, Tim (2008)
Probability Surveys [electronic only]
Similarity:
Asymptotic properties of random graphs
Zbigniew Palka
Similarity:
CONTENTS1. Introduction...........................................................................5 1.1. Purpose and scope..........................................................5 1.2. Probability-theoretic preliminaries....................................6 1.3. Graphs............................................................................11 1.4. Random graphs..............................................................132. Vertex-degrees....................................................................15 2.1....
Random dynamics and its applications.
Kifer, Yuri (1998)
Documenta Mathematica
Similarity:
On entropies of occupancy distributions
Ove Frank, Krzysztof Nowicki (1989)
Banach Center Publications
Similarity: