Skip to main navigation Skip to search Skip to main content

Minimal oriented graphs of diameter 2

  • University of Illinois at Urbana-Champaign
  • Alfréd Rényi Institute of Mathematics
  • National Sun Yat-sen University

Research output: Contribution to journal › Article › peer-review

20 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)345-350
Number of pages6
JournalGraphs and Combinatorics
Volume14
Issue number4
DOIs
StatePublished - 1998

Keywords

  • Crossintersecting families
  • Diameter of graphs
  • Digraphs

Fingerprint

Dive into the research topics of 'Minimal oriented graphs of diameter 2'. Together they form a unique fingerprint.

Cite this