Hamilton cycles in a random tournament

DOI10.1002/rsa.3240060209zbMath0819.05053OpenAlexW2051311854MaRDI QIDQ4697812

Svante Janson

Publication date: 1 May 1995

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240060209

zbMATH Keywords

projection methodmeanvarianceHamilton cyclesrandom tournament

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

On a uniformly random chord diagram and its intersection graph

Cites Work

• Unnamed Item
• The asymptotic distributions of generalized U-statistics with applications to random graphs
• A central limit theorem for generalized multilinear forms
• On the evolution of a random tournament
• Asymptotic normality of triad counts in random digraphs
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
• Stochastic Competition Graphs
• On the method of paired comparisons

This page was built for publication: Hamilton cycles in a random tournament