Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nakajima, Tamio-Vesa, Verwimp, Zephyr, Wrochna, Marcin, Živný, Stanislav
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Computational Complexity Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2501.12062