Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Counting two-forests and random cut size via potential theory (2308.03859v1)

Published 7 Aug 2023 in math.CO, math.DG, and math.PR

Abstract: We prove a lower bound on the number of spanning two-forests in a graph, in terms of the number of vertices, edges, and spanning trees. This implies an upper bound on the average cut size of a random two-forest. The main tool is an identity relating the number of spanning trees and two-forests to pairwise effective resistances in a graph. Along the way, we make connections to potential theoretic invariants on metric graphs.

Summary

We haven't generated a summary for this paper yet.