Defective colouring of hypergraphs
We prove that the vertices of every (r + 1)-uniform hypergraph with maximum degree ∆ may be coloured with c( ∆ d+1 ) 1/r colours such that each vertex is in at most d monochromatic edges. This result, which is best possible up to the value of the constant c, generalises the classical result of Erdos...
Main Authors: | Girão, A, Illingworth, F, Scott, AD, Wood, DR |
---|---|
Format: | Journal article |
Sprog: | English |
Udgivet: |
Wiley
2023
|
Lignende værker
-
Inapproximability of counting hypergraph colourings
af: Galanis, A, et al.
Udgivet: (2022) -
Linearly ordered colourings of hypergraphs
af: Nakajima, T-V, et al.
Udgivet: (2022) -
Linearly ordered colourings of hypergraphs
af: Nakajima, T-V, et al.
Udgivet: (2022) -
Constrained Colouring and σ-Hypergraphs
af: Caro Yair, et al.
Udgivet: (2015-02-01) -
New strong colouring of hypergraphs
af: Sandro Rajola, et al.
Udgivet: (2011-06-01)