English

Edge-Cuts and Rooted Spanning Trees

Combinatorics 2022-10-25 v1 Discrete Mathematics Data Structures and Algorithms

Abstract

We give a closed form formula to determine the size of a k-respecting cut. Further, we show that for any k, the size of the k-respecting cut can be found only using the size of 2-respecting cuts.

Cite

@article{arxiv.2210.13320,
  title  = {Edge-Cuts and Rooted Spanning Trees},
  author = {Mohit Daga},
  journal= {arXiv preprint arXiv:2210.13320},
  year   = {2022}
}
R2 v1 2026-06-28T04:22:13.581Z