On rainbow-free colourings of uniform hypergraphs

DOI10.1016/j.tcs.2021.06.022OpenAlexW3169266033MaRDI QIDQ1981770

Ragnar Groot Koerkamp, Stanislav Živný

Publication date: 6 September 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.07072

zbMATH Keywords

random hypergraphsno-rainbow colouringsrainbow-free colourings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

A note on rainbow-free colorings of uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of surjective homomorphism problems-a survey
• On the complexity of H-coloring
• Coloring mixed hypertrees
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• On generating all solutions of generalized satisfiability problems
• Classifying the Complexity of Constraints Using Finite Algebras