Counting Hamiltonian Paths in Transitive Tournaments
Abstract
We construct a combinatorial function F which computes the number of oriented Hamiltonian paths of any given type, in a transitive tournament. We also study many properties of F that arise, and reach some observations.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.