Erdős Problem #901 — Let $m(n)$ be minimal such that there is an $n$ -uniform hypergraph with $m(n)$ edges which is $3$ -chromatic.

About 65 years old · traced to 1961

Let $m(n)$ be minimal such that there is an $n$ -uniform hypergraph with $m(n)$ edges which is $3$ -chromatic. Estimate $m(n)$ .

References

Primary source

ULAM AI, UnsolvedMath dataset, Erdős Problems set, revision b9437975f3c873f635a13c48f8b022f5ba80898a; CC BY 4.0.

Additional references

UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.

combinatorics hypergraphs

InErdős Problems

Posted 1 month ago · edited 3 weeks ago

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.

No solutions have been posted yet.