MathDB

Erdős Problem #716 — The six-vertex three-edge hypergraph extremal problem

About 45 years old · traced to

Let F\mathcal F be the family of all 33-uniform hypergraphs with six vertices and three edges. Is ex⁡3(n,F)=o(n2)\operatorname{ex}_3(n,\mathcal F)=o(n^2)?

References

Primary source

P. Erdős, On the combinatorial problems which I would most like to see solved, Combinatorica 1 (1981), 25–42.

Additional references

P. Erdős, On the combinatorial problems which I would most like to see solved, Combinatorica 1 (1981), 25–42.

graph-theoryhypergraphs
InErdős Problems
Posted

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.