Login / Signup

On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs.

Soheil AzarpendarAmir Jafari
Published in: J. Comb. Theory, Ser. B (2021)
Keyphrases
  • lower bound
  • upper bound
  • language model
  • small number
  • fixed number
  • decision trees
  • computational complexity
  • neural network
  • np hard
  • branch and bound algorithm
  • finite number