1 citations · 1 across the 12 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
math.CO2026
Tight constructions for reconfigurations of independent transversals
Ronen Wdowinski
For a graph and partition of its vertex set, an independent transversal of is an independent set of that contains one vertex from each bloc…
math.CO2026
Sampling from the antiferromagnetic Ising model on bipartite, regular expander graphs
Anna Geisler, Mihyun Kang, Michail Sarantis +1
The antiferromagnetic Ising model samples subsets of vertices of a graph with weight decaying exponentially in the number of edges induced. We study the problem of sampling from th…
math.CO2026
Block-weighted random graphs: planar and beyond
Mihyun Kang, Zéphyr Salvy, Ronen Wdowinski
We investigate random connected graphs from a block-stable class whose distribution is weighted based on the number of -connected components, or blocks. This includes the class…