Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.17997 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917351892451328 |
|---|---|
| author | Ho, Boon Suan |
| author_facet | Ho, Boon Suan |
| contents | We prove Ehrenborg's conjecture that every connected bipartite graph $G$ with parts of size $m$ and $n$ has at most $\frac{1}{mn}\prod_{v\in V(G)} \operatorname{deg}(v)$ spanning trees, and that equality holds if and only if $G$ is a Ferrers graph. The proof is fully formalized in Lean 4. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_17997 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The Ferrers bound for spanning trees in bipartite graphs Ho, Boon Suan Combinatorics We prove Ehrenborg's conjecture that every connected bipartite graph $G$ with parts of size $m$ and $n$ has at most $\frac{1}{mn}\prod_{v\in V(G)} \operatorname{deg}(v)$ spanning trees, and that equality holds if and only if $G$ is a Ferrers graph. The proof is fully formalized in Lean 4. |
| title | The Ferrers bound for spanning trees in bipartite graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2603.17997 |