Erdős Problem 834

### What is the conjecture

https://www.erdosproblems.com/834

Does there exist a $3$-critical $3$-uniform hypergraph in which every vertex has degree $\geq 7$?

Status: verifiable

### Choose either option
- [ ] I plan on working on this conjecture
- [x] This issue is up for grabs: I would like to see this conjecture added by somebody else

Start with the conjecture statement at https://www.erdosproblems.com/834 and inspect existing formalized conjectures in the formal-conjectures repository to understand how this kind of statement is represented. Done means adding a formal statement for Erdős Problem 834 that captures the listed hypergraph question.

Written by the indexing model from the issue text.