Let f(n) be the minimum number of arcs among oriented graphs of order n and diameter 2. Here it is shown for n > 8 that (1 - o(1))n log n ≤ f(n) ≤ n log n - (3/2)n.
- Crossintersecting families
- Diameter of graphs
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics