On the pancyclicity of digraphs with large semi-degrees

S. Kh. Darbinyan

On the pancyclicity of digraphs with large semi-degrees

Combinatorics 2011-11-09 v1

Authors: S. Kh. Darbinyan

Abstract

Let $D$ be an directed graph on $p\geq 10$ vertices with minimum degree at least $p-1$ and minimum semi-degree at least $p/2 -1$ . We present a detailed proof of the following result [13]: The digraph $D$ is pancyclic, unless some extremal cases (which are characterized).

Keywords

digraph pancyclicity minimum semi-degree minimum degree extremal cases

Cite

@article{arxiv.1111.1841,
  title  = {On the pancyclicity of digraphs with large semi-degrees},
  author = {S. Kh. Darbinyan},
  journal= {arXiv preprint arXiv:1111.1841},
  year   = {2011}
}

Comments

32 pages

Related papers

View all related →