Mathematical logic quarterly · 1992 · 11 citations · 4 references
Natural SciencesMathematicsCombinatoricsTopologyCombinatorial Game TheoryHamiltonian SystemsHamiltonian GraphsTransitive Closure
Abstract We prove that if T is a tournament of order n > 6 in which any 4‐sub‐tournament is hamiltonian or transitive, then T is reconstructible in the sense of Ulam.
4
J. A. Bondy, Robert L. Hemminger · Journal of Graph Theory · 1977 · 255 citations
Gian‐Carlo Rota · Advances in Mathematics · 1991 · 35 citations
Management, Supply Chain Management, Leadership In Organizations +3