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...
主要な著者: | Girão, A, Illingworth, F, Scott, AD, Wood, DR |
---|---|
フォーマット: | Journal article |
言語: | English |
出版事項: |
Wiley
2023
|
類似資料
-
Inapproximability of counting hypergraph colourings
著者:: Galanis, A, 等
出版事項: (2022) -
Linearly ordered colourings of hypergraphs
著者:: Nakajima, T-V, 等
出版事項: (2022) -
Linearly ordered colourings of hypergraphs
著者:: Nakajima, T-V, 等
出版事項: (2022) -
Constrained Colouring and σ-Hypergraphs
著者:: Caro Yair, 等
出版事項: (2015-02-01) -
New strong colouring of hypergraphs
著者:: Sandro Rajola, 等
出版事項: (2011-06-01)