Login / Signup

A new lower bound for the chromatic number of general Kneser hypergraphs.

Roya Abyazi SaniMeysam Alishahi
Published in: Eur. J. Comb. (2018)
Keyphrases
  • lower bound
  • upper bound
  • special case
  • language model
  • data structure
  • small number
  • worst case
  • closely related
  • branch and bound
  • computational complexity
  • color images
  • np hard
  • higher order
  • finite number