A note on hardness of promise hypergraph colouring
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910794884579328 |
|---|---|
| author | Wrochna, Marcin |
| author_facet | Wrochna, Marcin |
| contents | We show a slightly simpler proof the following theorem by I. Dinur, O. Regev, and C. Smyth: for all $c \geq 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2205_14719 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | A note on hardness of promise hypergraph colouring Wrochna, Marcin Discrete Mathematics We show a slightly simpler proof the following theorem by I. Dinur, O. Regev, and C. Smyth: for all $c \geq 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. |
| title | A note on hardness of promise hypergraph colouring |
| topic | Discrete Mathematics |
| url | https://arxiv.org/abs/2205.14719 |