descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1990 English Publisher:Elsevier BVJournal:Journal of Combinatorial Theory, Series B, volume 50, pages 309-318 (issn: 0095-8956,

Authors: Roland Häggkvist; Béla Bollobás;

doi: 10.1016/0095-8956(90)90085-e

Powers of Hamilton cycles in tournaments

- Summary
- Subjects
- Metrics

Abstract

AbstractOur main aim is to show that for every ε > 0 and k ∈ N there is an n(ε, k) such that if T is a tournament of order n ≥n(ε, k) and in T every vertex has indegree at least (14+ε)n and at most (34−ε)n then T contains the kth power of a Hamilton cycle.

Related Organizations

View all View all

Keywords

Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Theoretical Computer Science

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	10
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average