DOIAbstract
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)
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)
A random bipartite graph D with 2n vertices is generated by allowing each of the n2 possible edges t...
AbstractGiven an r-regular graph G on n vertices with a Hamilton cycle, order its edges randomly and...
Abstract. For a graph G the random n-lift of G is obtained by re-placing each of its vertices by a s...
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...
Let G3−out denote the random graph on vertex set [n] in which each vertex chooses 3 neighbors unifor...
Abstract. We revisit the method of small subgraph conditioning, used to establish that random regula...
AbstractPósa proved that a random graph with cnlogn edges is Hamiltonian with probability tending to...
30 pagesInternational audienceWe apply in this article (non rigorous) statistical mechanics methods ...
For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G ob...
AbstractWe describe and analyse three simple efficient algorithms with good probabilistic behaviour;...
We determine exactly the expected number of hamilton cycles in the random graph obtained by starting...
For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G ob...
We design a randomized algorithm that finds a Hamilton cycle in O(n) time with high probability in a...
Abstract. Most NP- Complete problems have linear solutions when restricted to random graphs [2]. Ran...
A random bipartite graph D with 2n vertices is generated by allowing each of the n2 possible edges t...
AbstractGiven an r-regular graph G on n vertices with a Hamilton cycle, order its edges randomly and...
Abstract. For a graph G the random n-lift of G is obtained by re-placing each of its vertices by a s...
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...
Let G3−out denote the random graph on vertex set [n] in which each vertex chooses 3 neighbors unifor...
Abstract. We revisit the method of small subgraph conditioning, used to establish that random regula...
AbstractPósa proved that a random graph with cnlogn edges is Hamiltonian with probability tending to...
30 pagesInternational audienceWe apply in this article (non rigorous) statistical mechanics methods ...
For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G ob...
AbstractWe describe and analyse three simple efficient algorithms with good probabilistic behaviour;...
We determine exactly the expected number of hamilton cycles in the random graph obtained by starting...
For a given graph G of minimum degree at least k, let Gp denote the random spanning subgraph of G ob...
We design a randomized algorithm that finds a Hamilton cycle in O(n) time with high probability in a...
Abstract. Most NP- Complete problems have linear solutions when restricted to random graphs [2]. Ran...
A random bipartite graph D with 2n vertices is generated by allowing each of the n2 possible edges t...
AbstractGiven an r-regular graph G on n vertices with a Hamilton cycle, order its edges randomly and...
Abstract. For a graph G the random n-lift of G is obtained by re-placing each of its vertices by a s...
Add to ORKG