Skip to main content
Presentation
Minimum number of edges in digraphs with specified diameter
AMS Fall Central Sectional Meeting (2016)
  • Zoltan Furedi, University of Illinois at Urbana-Champaign
  • Sogol Jahanbekam, Rochester Institute of Technology
Abstract
Let r(n, d) be the smallest number of edges an n-vertex digraph with diameter at most d can have. In 1987 Dawes and Meijer conjectured that when d ≥ 4, we have r(n, d) = n + n b d 2 c + O(1). Earlier, Goldberg determined r(n, d) for the case d is even. We prove this conjecture for odd integers d, 
Publication Date
October 30, 2016
Location
Minneapolis, MN
Citation Information
Zoltan Furedi and Sogol Jahanbekam. "Minimum number of edges in digraphs with specified diameter" AMS Fall Central Sectional Meeting (2016)
Available at: http://works.bepress.com/sogol-jahanbekam/24/