2 papers
math.CO2025
Improved Decomposition Bounds for Partition Polytopes and Odd-Covers
Steffen Borgwardt, Zdeněk Dvořák, Bryce Frederickson +2
The assignments of a set of items into clusters of prescribed sizes can be encoded as the vertices of the partition polytope . W…
math.CO2022
On the Edge Derivative of the Normalized Laplacian with Applications to Kemeny's Constant
Connor Albright, Kimberly P. Hadaway, Ari Holcombe Pomerance +3
In a connected graph, Kemeny's constant gives the expected time of a random walk from an arbitrary vertex to reach a randomly-chosen vertex . Because of this, Kemeny's const…