The maximum number of Hamiltonian paths in tournaments

Noga Mordechai Alon

doi:10.1007/BF02128667

The maximum number of Hamiltonian paths in tournaments

Noga Mordechai Alon

Research output: Contribution to journal › Article › peer-review

23 Scopus citations

Abstract

Solving an old conjecture of Szele we show that the maximum number of directed Hamiltonian paths in a tournament on n vertices is at most c · n^3/2· n!/2^n-1, where c is a positive constant independent of n.

Original language	English (US)
Pages (from-to)	319-324
Number of pages	6
Journal	Combinatorica
Volume	10
Issue number	4
DOIs	https://doi.org/10.1007/BF02128667
State	Published - Dec 1 1990
Externally published	Yes

All Science Journal Classification (ASJC) codes

Discrete Mathematics and Combinatorics
Mathematics(all)

Access to Document

10.1007/BF02128667

Cite this

@article{d31673e0cd794742801697e9389081c7,

title = "The maximum number of Hamiltonian paths in tournaments",

abstract = "Solving an old conjecture of Szele we show that the maximum number of directed Hamiltonian paths in a tournament on n vertices is at most c · n3/2· n!/2n-1, where c is a positive constant independent of n.",

author = "Alon, {Noga Mordechai}",

year = "1990",

month = dec,

day = "1",

doi = "10.1007/BF02128667",

language = "English (US)",

volume = "10",

pages = "319--324",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "4",

}

TY - JOUR

T1 - The maximum number of Hamiltonian paths in tournaments

AU - Alon, Noga Mordechai

PY - 1990/12/1

Y1 - 1990/12/1

N2 - Solving an old conjecture of Szele we show that the maximum number of directed Hamiltonian paths in a tournament on n vertices is at most c · n3/2· n!/2n-1, where c is a positive constant independent of n.

AB - Solving an old conjecture of Szele we show that the maximum number of directed Hamiltonian paths in a tournament on n vertices is at most c · n3/2· n!/2n-1, where c is a positive constant independent of n.

UR - http://www.scopus.com/inward/record.url?scp=0040198191&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0040198191&partnerID=8YFLogxK

U2 - 10.1007/BF02128667

DO - 10.1007/BF02128667

M3 - Article

AN - SCOPUS:0040198191

SN - 0209-9683

VL - 10

SP - 319

EP - 324

JO - Combinatorica

JF - Combinatorica

IS - 4

ER -

The maximum number of Hamiltonian paths in tournaments

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this