"On the maximum number of Hamiltonian paths in tournaments."

Ilan Adler, Noga Alon, Sheldon M. Ross (2001)

> Home

Details and statistics

DOI: 10.1002/RSA.1010

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/AdlerAR01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/AdlerAR01
Ilan Adler, Noga Alon, Sheldon M. Ross:
On the maximum number of Hamiltonian paths in tournaments. Random Struct. Algorithms 18(3): 291-296 (2001)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.