English

A degree condition for diameter two orientability of graphs

Combinatorics 2018-07-03 v1

Abstract

For nNn \in \mathbb{N} let δn\delta_n be the smallest value such that every graph of order nn and minimum degree at least δn\delta_n admits an orientation of diameter two. We show that δn=n2+Θ(lnn)\delta_n=\frac{n}{2} + \Theta(\ln n).

Keywords

Cite

@article{arxiv.1807.00032,
  title  = {A degree condition for diameter two orientability of graphs},
  author = {Éva Czabarka and Peter Dankelmann and László A. Székely},
  journal= {arXiv preprint arXiv:1807.00032},
  year   = {2018}
}
R2 v1 2026-06-23T02:46:31.758Z