1 citations · 1 across the 12 of their papers we have counts for
13 papers
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…
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…
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…
Hall's theorem for reconfigurations and higher dimensional topological connectedness
Ronen Wdowinski
One widely applied sufficient condition for the existence of a colorful simplex in a vertex-colored simplicial complex is a topological extension of Hall's transversal theorem due…
Counting independent sets in percolated graphs via the Ising model
Anna Geisler, Mihyun Kang, Michail Sarantis +1
Given a graph , we form a random subgraph by including each edge of independently with probability . We provide an asymptotic expansion of the expected number of in…
Bounded degree graphs and hypergraphs with no full rainbow matchings
Ronen Wdowinski
Given a multi-hypergraph that is edge-colored into color classes , a full rainbow matching is a matching of that contains exactly one edge from each color…
Constructing graphs with no independent transversals
Penny Haxell, Ronen Wdowinski
Given a graph and a partition of its vertex set, an independent transversal (IT) is an independent set of that contains one vertex from each block in . Various suffi…
A precise condition for independent transversals in bipartite covers
Stijn Cambie, Penny Haxell, Ross J. Kang +1
Given a bipartite graph in which any vertex in (resp.~) has degree at most (resp.~), suppose there is a partition of that is a refin…
Degree criteria and stability for independent transversals
Penny Haxell, Ronen Wdowinski
An \emph{independent transversal} (IT) in a graph with a given vertex partition is an independent set of vertices of (i.e. it induces no edges), that consists of one ve…
On an -coloring generalization of linear arboricity of multigraphs
Ronen Wdowinski
Given a multigraph and function on its vertices, a degree- subgraph of is a spanning subgraph in which every vertex has deg…
Orientation-based edge-colorings and linear arboricity of multigraphs
Ronen Wdowinski
The Goldberg-Seymour Conjecture for -colorings states that the -chromatic index of a loopless multigraph is essentially determined by either a maximum degree or a maximum den…
Partitioning the power set of into -free parts
Eben Blaisdell, András Gyárfás, Robert A. Krueger +1
We show that for , in any partition of , the set of all subsets of , into parts, some part must contain a triangl…
On zigzag maps and the path category of an inverse semigroup
Allan Donsig, Jennifer Gensler, Hannah King +2
We study the path category of an inverse semigroup admitting unique maximal idempotents and give an abstract characterization of the inverse semigroups arising from zigzag maps on…