AbstractThe probability that a random graph with n vertices and cn log n edges contains a Hamiltonian circuit tends to 1 as n → ∞ (if c is sufficiently large)
We show that, in almost every $n$-vertex random directed graph process, a copy of every possible $n$...
For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G ob...
We provide an annotated bibliography for the study of Hamilton cycles in random graphs and hypergrap...
AbstractPósa proved that a random graph with cn log n edges is Hamiltonian with probability tending ...
AbstractThe probability that a random graph with n vertices and cn log n edges contains a Hamiltonia...
AbstractPósa proved that a random graph with cnlogn edges is Hamiltonian with probability tending to...
A random bipartite graph D with 2n vertices is generated by allowing each of the n2 possible edges t...
AbstractA digraph with n vertices and fixed outdegree m is generated randomly so that each such digr...
AbstractLet r ⩾ 1 be a fixed positive integer. We give the limiting distribution for the probability...
AbstractWe describe a polynomial time (O(n3 log n)) algorithm which has a high probability of findin...
Given an $n$ vertex graph whose edges have colored from one of $r$ colors $C=\{c_1,c_2,\ldots,c_r\}$...
AbstractLet G(n, p) be a graph on n vertices in which each possible edge is presented independently ...
For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G ob...
AbstractLet G(n,p) denote the probability space of the set G of graphs G = (Vn, E) with vertex set V...
<p>Let f be an edge ordering of Kn: a bijection E(Kn) → {1, 2, . . . , n2}. For an edge e ∈ E(Kn), w...
We show that, in almost every $n$-vertex random directed graph process, a copy of every possible $n$...
For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G ob...
We provide an annotated bibliography for the study of Hamilton cycles in random graphs and hypergrap...
AbstractPósa proved that a random graph with cn log n edges is Hamiltonian with probability tending ...
AbstractThe probability that a random graph with n vertices and cn log n edges contains a Hamiltonia...
AbstractPósa proved that a random graph with cnlogn edges is Hamiltonian with probability tending to...
A random bipartite graph D with 2n vertices is generated by allowing each of the n2 possible edges t...
AbstractA digraph with n vertices and fixed outdegree m is generated randomly so that each such digr...
AbstractLet r ⩾ 1 be a fixed positive integer. We give the limiting distribution for the probability...
AbstractWe describe a polynomial time (O(n3 log n)) algorithm which has a high probability of findin...
Given an $n$ vertex graph whose edges have colored from one of $r$ colors $C=\{c_1,c_2,\ldots,c_r\}$...
AbstractLet G(n, p) be a graph on n vertices in which each possible edge is presented independently ...
For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G ob...
AbstractLet G(n,p) denote the probability space of the set G of graphs G = (Vn, E) with vertex set V...
<p>Let f be an edge ordering of Kn: a bijection E(Kn) → {1, 2, . . . , n2}. For an edge e ∈ E(Kn), w...
We show that, in almost every $n$-vertex random directed graph process, a copy of every possible $n$...
For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G ob...
We provide an annotated bibliography for the study of Hamilton cycles in random graphs and hypergrap...
DOI
Add to ORKG