Counting the Number of Hamilton Cycles in Random Digraphs
From MaRDI portal
Publication:4014635
DOI10.1002/rsa.3240030303zbMath0771.05089WikidataQ57401591 ScholiaQ57401591MaRDI QIDQ4014635
Publication date: 18 October 1992
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240030303
05C80: Random graphs (graph-theoretic aspects)
05C30: Enumeration in graph theory
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
Related Items
Approximating the permanent: A simple approach, The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph, Random Regular Graphs: Asymptotic Distributions and Contiguity, Packing, counting and covering Hamilton cycles in random directed graphs, Approximately Counting Embeddings into Random Graphs, Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings, An analysis of Monte Carlo algorithm for estimating the permanent
Cites Work