Login / Signup
Sharp bounds for the chromatic number of random Kneser graphs.
Sergei Kiselev
Andrey Kupavskii
Published in:
CoRR (2018)
Keyphrases
</>
language model
upper bound
real time
fixed number
database
computational complexity
lower bound
multi class
small number
worst case