Éva Czabarka, Peter Dankelmann, László A. Székely
Published 2018-06-29Version 1
For $n \in \mathbb{N}$ let $\delta_n$ be the smallest value such that every graph of order $n$ and minimum degree at least $\delta_n$ admits an orientation of diameter two. We show that $\delta_n=\frac{n}{2} + \Theta(\ln n)$.
A degree condition for cycles of maximum length in bipartite digraphs
A Degree Condition for a Graph to Have All $(a,b)$-Factors
On the Turán number of 1-subdivision of $K_{3,t}$
![QR code for arXiv:1807.00032 [math.CO]](http://oss.arxitics.com/images/favicon.svg)