2000 character limit reached
A conjectured bound on the spanning tree number of bipartite graphs
Published 5 Aug 2016 in math.CO | (1608.01929v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.