Vaidy Sivaraman

activity

20112026

most citedClasses of graphs with no long cycle as a vertex-minor are polynomially

χ

-bounded

9 citations · 27 across the 19 of their papers we have counts for

collaborators

Showing 2019Show all

3 papers · 1 filter

math.CO2019★ 1 cited

Cop number of graphs without long holes

Vaidy Sivaraman

A hole in a graph is an induced cycle of length at least 4. We give a simple winning strategy for t-3 cops to capture a robber in the game of cops and robbers played in a graph tha…

math.CO2019★ 1 cited

Cop number of $2 K_{2}$ -free graphs

Vaidy Sivaraman, Stephen Testa

We prove that the cop number of a $2 K_{2}$ -free graph is at most $2$ if it has diameter $3$ or does not have an induced cycle of length $k$ , where $k \in {3, 4, 5}$ . We conjecture…

math.CO2019

An application of the Gyárfás path argument

Vaidy Sivaraman

We adapt the Gyárfás path argument to prove that $t - 2$ cops can capture a robber, in at most $t - 1$ moves, in the game of cops and robbers played in a graph that does not contain th…

Cop number of graphs without long holes

Cop number of 2K2​-free graphs

An application of the Gyárfás path argument

Cop number of $2 K_{2}$ -free graphs