๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Hamilton Paths in Tournaments and a Problem of McMullen on Projective Transformations in Rd

โœ Scribed by Vergnas, M. L.

Book ID
120092322
Publisher
Oxford University Press
Year
1986
Tongue
English
Weight
54 KB
Volume
18
Category
Article
ISSN
0024-6093

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Solution of a conjecture of Volkmann on
Solution of a conjecture of Volkmann on longest paths through an arc in strongly connected in-tournaments
โœ Dirk Meierling ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 139 KB ๐Ÿ‘ 1 views

## Abstract An inโ€tournament is an oriented graph such that the negative neighborhood of every vertex induces a tournament. Let __m__โ€‰=โ€‰4 or __m__โ€‰=โ€‰5 and let __D__ be a strongly connected inโ€tournament of order ${{n}}\geq {{2}}{{m}}-{{2}}$ such that each arc belongs to a directed path of order at