Conflict-free colourings of uniform hypergraphs with few edges
type: Item
instance of: scholarly article
zbMATH Open document ID: 1247.05082
DOI: 10.1017/S0963548312000156
author: M. Kumbhat
author: Tomasz Łuczak
author: Alexandr Kostochka
published in: Combinatorics, Probability and Computing
publication date: 2012-09-04T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6076527
zbMATH Keywords: vertex colouring
zbMATH Keywords: uniform hypergraphs
MaRDI profile type: Publication
cites work: Conflict-free coloring of points and simple regions in the plane
cites work: Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
cites work: Online Conflict‐Free Coloring for Intervals
cites work: On 3-chromatic hypergraphs
cites work: Deterministic conflict-free coloring for intervals
cites work: Bombieri's theorem in short intervals
cites work: Coloring n-sets red and blue
cites work: Improved bounds and algorithms for hypergraph 2-coloring
cites work: Hypergraphs with high chromatic number
cites work: Conflict-Free Colourings of Graphs and Hypergraphs
cites work: Online Conflict-Free Colorings for Hypergraphs
title: Conflict-free colourings of uniform hypergraphs with few edges
description: scientific article; zbMATH DE number 6076527