!!Projects per year
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 language | English |
|---|---|
| Pages (from-to) | 345-350 |
| Number of pages | 6 |
| Journal | Graphs and Combinatorics |
| Volume | 14 |
| Issue number | 4 |
| DOIs | |
| State | Published - 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.Projects
- 1 Finished
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver