Erdős Problem #834 — Minimum degree seven in a 3-critical 3-graph
Does there exist a -critical -uniform hypergraph in which every vertex has degree at least ?
References
Primary source
R. Li, On an Erdős–Lovász problem: 3-critical 3-graphs of minimum degree 7, arXiv:2512.24850 (2025).
Additional references
R. Li, On an Erdős–Lovász problem: 3-critical 3-graphs of minimum degree 7, arXiv:2512.24850 (2025).
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.