A conjectured bound on the spanning tree number of bipartite graphs

TL;DR

This paper discusses the Ferrers bound conjecture related to counting spanning trees in Ferrers graphs, reviews its current status, and proposes a new conjecture that implies the original.

Contribution

It presents the current status of the Ferrers bound conjecture and introduces a new conjecture that implies it, advancing understanding in graph enumeration.

Findings

Current status of the Ferrers bound conjecture documented

A new conjecture proposed that implies the Ferrers bound conjecture

Provides insights into spanning tree enumeration in Ferrers graphs

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.