𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Limit distribution for the existence of Hamiltonian cycles in a random graph

✍ Scribed by János Komlós; Endre Szemerédi

Book ID
108113655
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
172 KB
Volume
306
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Limit distribution for the existence of
Limit distribution for the existence of hamiltonian cycles in a random graph
✍ János Komlós; Endre Szemerédi 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 874 KB

P&a proved that a random graph with clt log n edges is Hamiltonian with probability tending to 1 if c >3. Korsunov improved this by showing that, if Gn is a random graph with \*n log n + in log log n + f(n)n edges and f(n) --\*m, then G" is Hamiltonian, with probability tending to 1. We shall prove

On the existence of Hamiltonian cycles i
On the existence of Hamiltonian cycles in a class of random graphs
✍ T.I. Fenner; A.M. Frieze 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 468 KB

A digraph with n vertices and fixed outdegree m is generated randomly so that each such digraph is equally likely to be chosen. We consider the probability of the existence of a Hamiltonian cycle in the graph obtained by ignoring arc orientation. We show that there exists m (~23) such that a Hamilto

On the number of hamiltonian cycles in a
On the number of hamiltonian cycles in a maximal planar graph
✍ S. L. Hakimi; E. F. Schmeichel; C. Thomassen 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 2 views

## Abstract We consider the problem of the minimum number of Hamiltonian cycles that could be present in a Hamiltonian maximal planar graph on __p__ vertices. In particular, we construct a __p__‐vertex maximal planar graph containing exactly four Hamiltonian cycles for every __p__ ≥ 12. We also pro