Erdős Problem 724

### What is the conjecture

https://www.erdosproblems.com/724

Let $f(n)$ be the maximum number of mutually orthogonal Latin squares of order $n$. Is it true that
$$f(n) \gg n^{1/2}?$$

Status: open

### 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

Read the conjecture and status at erdosproblems.com/724, then inspect the formal-conjectures repository for how existing conjectures are represented in Lean. The issue names no file or test, so the starting entry point must be found in the repository. Done means the Erdős Problem 724 statement has been added to the collection in a verified Lean form.

Written by the indexing model from the issue text.