The Ferrers bound for spanning trees in bipartite graphs
math.CO
Submitted: 2026-03-18
Updated: 2026-11-15
Code: https://github.com/boonsuan/FerrersBound
Terminology
Sources
- A conjectured bound on the spanning tree number of bipartite graphs
- On the number of spanning trees in bipartite graphs
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality