Approximate Graph Colouring and the Crystal with a Hollow Shadow
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911111684554752 |
|---|---|
| author | Ciardo, Lorenzo Živný, Stanislav |
| author_facet | Ciardo, Lorenzo Živný, Stanislav |
| contents | We show that approximate graph colouring is not solved by the lift-and-project hierarchy for the combination of linear programming and linear Diophantine equations. The proof is based on combinatorial tensor theory. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2211_03168 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Approximate Graph Colouring and the Crystal with a Hollow Shadow Ciardo, Lorenzo Živný, Stanislav Computational Complexity Discrete Mathematics Combinatorics Optimization and Control We show that approximate graph colouring is not solved by the lift-and-project hierarchy for the combination of linear programming and linear Diophantine equations. The proof is based on combinatorial tensor theory. |
| title | Approximate Graph Colouring and the Crystal with a Hollow Shadow |
| topic | Computational Complexity Discrete Mathematics Combinatorics Optimization and Control |
| url | https://arxiv.org/abs/2211.03168 |