64 citations · 127 across the 14 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017★ 2 cited
Sum-perfect graphs
Bart Litjens, Sven Polak, Vaidy Sivaraman
Inspired by a famous characterization of perfect graphs due to Lovász, we define a graph to be sum-perfect if for every induced subgraph of , .…
math.CO2017
Uniqueness of codes using semidefinite programming
Andries E. Brouwer, Sven C. Polak
For , let denote the maximum size of a binary code of word length , minimum distance and constant weight . Schrijver recently showed usin…
math.CO2017★ 13 cited
Semidefinite programming bounds for constant weight codes
Sven Polak
For nonnegative integers , let be the maximum size of a code with constant weight and minimum distance at least . We consider…