Suppose that the cover time of an undirected $n$-vertex graph is $O(n \log n)$. My intuition is that graphs like that have all their vertices close to each other. I'm wondering if it is true that an undirected graph with this cover time has diameter bounded above by a power of $\log n$?
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
|
|
