A logarithmic approximation of linearly-ordered colourings
A linearly ordered (LO) k-colouring of a hypergraph assigns to each vertex a colour from the set {0,1,…,k-1} in such a way that each hyperedge has a unique maximum element. Barto, Batistelli, and Berg conjectured that it is NP-hard to find an LO k-colouring of an LO 2-colourable 3-uniform hypergraph...
Main Authors: | Håstad, J, Martinsson, B, Nakajima, T-V, Zivny, S |
---|---|
格式: | Conference item |
语言: | English |
出版: |
Schloss Dagstuhl
2024
|
相似书籍
-
Linearly ordered colourings of hypergraphs
由: Nakajima, T-V, et al.
出版: (2022) -
Linearly ordered colourings of hypergraphs
由: Nakajima, T-V, et al.
出版: (2022) -
Approximate graph colouring and crystals
由: Ciardo, L, et al.
出版: (2023) -
Approximate graph colouring and the hollow shadow
由: Zivny, S, et al.
出版: (2023) -
Semidefinite Approximations of the Matrix Logarithm
由: Fawzi, Hamza, et al.
出版: (2019)