20 citations · 106 across the 85 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
math.CO2016
The Roller-Coaster Conjecture Revisited
Vadim E. Levit, Eugen Mandrescu
A graph is well-covered if all its maximal independent sets are of the same cardinality (Plummer, 1970). If G is a well-covered graph, has at least two vertices, and G-v is well-co…
math.CO2016★ 1 cited
1-well-covered graphs revisited
Vadim E. Levit, Eugen Mandrescu
A graph is well-covered if all its maximal independent sets are of the same size (M. D. Plummer, 1970). A well-covered graph is 1-well-covered if the deletion of every vertex leave…
math.CO2016
Violator spaces vs closure spaces
Yulia Kempner, Vadim E. Levit
Violator Spaces were introduced by J. Matousek et al. in 2008 as generalization of Linear Programming problems. Convex geometries were invented by Edelman and Jamison in 1985 as pr…