A Bound on the Number of Spanning Trees in Bipartite Graphs
Richard Ehrenborg conjectured that in a bipartite graph G with parts X and Y, the number of spanning trees is at most the product of the vertex degrees divided by |X|⋅|Y|. We make two main contributions. First, using techniques from spectral graph theory, we show that the conjecture holds for suffic...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Scholarship @ Claremont
2016
|
| Subjects: | |
| Online Access: | https://scholarship.claremont.edu/hmc_theses/73 https://scholarship.claremont.edu/cgi/viewcontent.cgi?article=1089&context=hmc_theses |