Files and links (1)
Preprint (Author's original)arXiv.org - Non-exclusive license to distribute, Open
Preprint
Degree Sequences vs. Forests in Bipartite Graphs
02 Mar 2026
Abstract
We prove a conjecture of Shteiner and Shteyner stating that for a bipartite graphG=(V,E) , the number of forests inGequals the number of degree sequences arising from its spanning subgraphs. In the process, we provide several equivalent evaluations of the Tutte polynomialT_(G)(x,y)at(2,1) , including interpretations in terms of degree vectors obtained from orientations ofG .
Metrics
1 Record Views
Details
- Title
- Degree Sequences vs. Forests in Bipartite Graphs
- Creators
- Darij Grinberg - Drexel UniversityBenjamin Liber - Drexel University
- Resource Type
- Preprint
- Language
- English
- Academic Unit
- Mathematics
- Other Identifier
- 991022166401404721