Hamilton cycles in 3‐out
Copyright policy )Hamilton cycles in 3‐out
AbstractLet G3‐out denote the random graph on vertex set [n] in which each vertex chooses three neighbors uniformly at random. Note that G3‐out has minimum degree 3 and average degree 6. We prove that the probability that G3‐out is Hamiltonian goes to 1 as n tends to infinity. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009
- Carnegie Mellon University United States
Eulerian and Hamiltonian graphs, Probability (math.PR), Random graphs (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, 3-out, Combinatorics (math.CO), Hamilton cycles, random graphs, sparse graphs, Mathematics - Probability
Eulerian and Hamiltonian graphs, Probability (math.PR), Random graphs (graph-theoretic aspects), FOS: Mathematics, Mathematics - Combinatorics, 3-out, Combinatorics (math.CO), Hamilton cycles, random graphs, sparse graphs, Mathematics - Probability
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).23 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!