Ronen Wdowinski

collaborators

7 papers

math.CO2026

Counting independent sets in percolated graphs via the Ising model

Anna Geisler, Mihyun Kang, Michail Sarantis +1

Given a graph $G$ , we form a random subgraph $G_{p}$ by including each edge of $G$ independently with probability $p$ . We provide an asymptotic expansion of the expected number of in…

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 $2$ -connected components, or blocks. This includes the class…

math.CO2026

Tight constructions for reconfigurations of independent transversals

Ronen Wdowinski

For a graph $G$ and partition $U$ of its vertex set, an independent transversal of $(G, U)$ is an independent set of $G$ that contains one vertex from each bloc…

math.CO2026

Constructing graphs with no independent transversals

Penny Haxell, Ronen Wdowinski

Given a graph $G$ and a partition $P$ of its vertex set, an independent transversal (IT) is an independent set of $G$ that contains one vertex from each block in $P$ . Various suffi…

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.CO2025

Bounded degree graphs and hypergraphs with no full rainbow matchings

Ronen Wdowinski

Given a multi-hypergraph $G$ that is edge-colored into color classes $E_{1}, \dots, E_{n}$ , a full rainbow matching is a matching of $G$ that contains exactly one edge from each color…