Erdős Problem 915

### What is the conjecture

https://www.erdosproblems.com/915

Let $G$ be a graph with $1+nm$ vertices and $1+n\binom{m}{2}$ edges. Must $G$ contain two points which are connected by $m$ disjoint paths?

Status: falsifiable

### 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 linked Erdős Problem 915 statement and inspect existing formalized Erdős problems in this repository. Formalize the conjecture in Lean, including its vertex and edge counts and the conclusion about disjoint paths; done means the conjecture has been added in an accepted project form.

Written by the indexing model from the issue text.