3 citations · 6 across the 14 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018
Lower bounds for Max-Cut in -free graphs via semidefinite programming
Charles Carlson, Alexandra Kolla, Ray Li +3
For a graph , let denote the size of the maximum cut in . The problem of estimating as a function of the number of vertices and edges of has a long history…
math.CO2018
Play in Candy Nim
Nitya Mani, Rajiv Nelakanti, Simon Rubinstein-Salzedo +1
Candy Nim is a variant of Nim in which both players aim to take the last candy in a game of Nim, with the added simultaneous secondary goal of taking as many candies as possible. W…