Ronen Wdowinski

activity

20182026

most citedOn zigzag maps and the path category of an inverse semigroup

1 citations · 1 across the 12 of their papers we have counts for

collaborators

Showing 2023Show all

4 papers · 1 filter

math.CO2023

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

A precise condition for independent transversals in bipartite covers

Stijn Cambie, Penny Haxell, Ross J. Kang +1

Given a bipartite graph $H = (V = V_{A} \cup V_{B}, E)$ in which any vertex in $V_{A}$ (resp.~ $V_{B}$ ) has degree at most $D_{A}$ (resp.~ $D_{B}$ ), suppose there is a partition of $V$ that is a refin…

math.CO2023

Degree criteria and stability for independent transversals

Penny Haxell, Ronen Wdowinski

An \emph{independent transversal} (IT) in a graph $G$ with a given vertex partition $P$ is an independent set of vertices of $G$ (i.e. it induces no edges), that consists of one ve…

math.CO2023

On an $f$ -coloring generalization of linear arboricity of multigraphs

Ronen Wdowinski

Given a multigraph $G$ and function $f : V (G) \to Z_{\geq 2}$ on its vertices, a degree- $f$ subgraph of $G$ is a spanning subgraph in which every vertex $v$ has deg…

Constructing graphs with no independent transversals

A precise condition for independent transversals in bipartite covers

Degree criteria and stability for independent transversals

On an f-coloring generalization of linear arboricity of multigraphs

On an $f$ -coloring generalization of linear arboricity of multigraphs