AI Chat AI Image Generator AI Video Text to Speech

A note on hardness of promise hypergraph colouring

05/29/2022

∙

by Marcin Wrochna, et al.

∙

∙

We show a slightly simpler proof the following theorem by I. Dinur, O. Regev, and C. Smyth: for all c ≥ 2, it is NP-hard to find a c-colouring of a 2-coloruable 3-uniform hypergraph. We recast this result in the algebraic framework for Promise CSPs, using only a weaker version of the PCP theorem.

page 1

page 2

page 3

research

∙ 07/20/2021

Combinatorial Gap Theorem and Reductions between Promise CSPs

A value of a CSP instance is typically defined as a fraction of constrai...

0 Libor Barto, et al. ∙

research

∙ 10/05/2018

Improved Inapproximability of Rainbow Coloring

A rainbow q-coloring of a k-uniform hypergraph is a q-coloring of the ve...

0 Per Austrin, et al. ∙

research

∙ 04/12/2022

Linearly ordered colourings of hypergraphs

A linearly ordered (LO) k-colouring of an r-uniform hypergraph assigns a...

0 Tamio-Vesa Nakajima, et al. ∙

research

∙ 04/02/2019

Simplified inpproximability of hypergraph coloring via t-agreeing families

We reprove the results on the hardness of approximating hypergraph color...

0 Per Austrin, et al. ∙

research

∙ 09/08/2023

Note on polychromatic coloring of hereditary hypergraph families

We exhibit a 5-uniform hypergraph that has no polychromatic 3-coloring, ...

0 Dömötör Pálvölgyi, et al. ∙

research

∙ 08/24/2022

An asymptotic resolution of a conjecture of Szemerédi and Petruska

Consider a 3-uniform hypergraph of order n with clique number k such tha...

0 André E. Kézdy, et al. ∙

research

∙ 07/22/2022

A simple and sharper proof of the hypergraph Moore bound

The hypergraph Moore bound is an elegant statement that characterizes th...

0 Jun-Ting Hsieh, et al. ∙