The maximum number of Hamiltonian paths in tournaments
From MaRDI portal
Publication:2276976
DOI10.1007/BF02128667zbMath0724.05036MaRDI QIDQ2276976
Publication date: 1990
Published in: Combinatorica (Search for Journal in Brave)
permanents; tournaments; maximum number; (0,1)-matrices; application of Minc's conjecture; Hamiltonian directed paths
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C20: Directed graphs (digraphs), tournaments
Related Items
What Moser <em>Could</em> Have Asked: Counting Hamilton Cycles in Tournaments, On the Maximum Number of Spanning Copies of an Orientation in a Tournament, About the number of oriented Hamiltonian paths and cycles in tournaments, Paths of given length in tournaments, Counting and packing Hamilton cycles in dense graphs and oriented graphs, A survey on Hamilton cycles in directed graphs, On testing Hamiltonicity of graphs, An updated survey on the linear ordering problem for weighted or unweighted tournaments, The number of Hamiltonian decompositions of regular graphs, Some remarks on \((k-1)\)-critical subgraphs of \(k\)-critical graphs, Enumeration of labeled and unlabeled Hamiltonian cycles in complete \(k\)-partite graphs, Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs, About the number of directed paths in tournaments, A survey on the linear ordering problem for weighted or unweighted tournaments, On the maximum number of Hamiltonian paths in tournaments
Cites Work
