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 2016Show all

2 papers · 1 filter

math.CO2016★ 8 cited

Some problems on induced subgraphs

Vaidy Sivaraman

We discuss some problems related to induced subgraphs. The first problem is about getting a good upper bound for the chromatic number in terms of the clique number for graphs in wh…

math.CO2016

Mock Threshold Graphs

Richard Behr, Vaidy Sivaraman, Thomas Zaslavsky

Mock threshold graphs are a simple generalization of threshold graphs that, like threshold graphs, are perfect graphs. Our main theorem is a characterization of mock threshold grap…