A conjectured bound on the spanning tree number of bipartite graphs
arXiv:1608.01929
Abstract
The Ferrers bound conjecture is a natural graph-theoretic extension of the enumeration of spanning trees for Ferrers graphs. We document the current status of the conjecture and provide a further conjecture which implies it.
6 pages; added references, acknowledgments, and counterexample to more general conjecture