Hamiltonian degree sequences in digraphs

  • Authors:

  • Daniela Kühn;Deryk Osthus;Andrew Treglown

  • Affiliations:

  • School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK;School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK;School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK

  • Venue:
  • Journal of Combinatorial Theory Series B
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that for each @h0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d"1^+==i+@hn or d"n"-"i"-"@h"n^-=n-i and (ii) d"i^-=i+@hn or d"n"-"i"-"@h"n^+=n-i for all i