Simplified inpproximability of hypergraph coloring via t-agreeing families.

Per Austrin Amey Bhangale Aditya Potukuchi

Published in: CoRR (2019)

Keyphrases

higher order
high order
pairwise
np hard
hypergraph model
multi agent
pattern recognition
special case
hypergraph partitioning