Good and nice colorings of balanced hypergraphs

被引：0
|
作者：
de Werra, D. [1 ]
机构：
[1] Ecole Polytech Fed Lausanne, Fac Sci Base, Inst Math IMA RO SE, CH-1015 Lausanne, Switzerland
来源：
DISCRETE MATHEMATICS | 2006年 / 306卷 / 19-20期
关键词：
balanced matrices; oriented hypergraphs; good colorings; totally unimodular matrices;
D O I：
10.1016/j.disc.2005.12.044
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Good k-colorings have been defined by C. Berge who showed their existence in balanced hypergraphs. There is a simple generalization to oriented balanced hypergraphs: using the bi-coloring characterization of 0, +/- 1-matrices of M. Conforti and G. Comuejols, we show that oriented balanced hypergraphs have good k-colorings for any k. A stronger type of coloring is also shown to exist for oriented balanced hypergraphs. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：2630 / 2636
页数：7
相关论文
共 50 条
  • [41] Chain method for panchromatic colorings of hypergraphs
    Akhmejanova, Margarita
    Balogh, Jozsef
    Shabanov, Dmitrii
    [J]. DISCRETE APPLIED MATHEMATICS, 2022, 321 : 72 - 81
  • [42] H-colorings of dense hypergraphs
    Szymanska, Edyta
    [J]. INFORMATION PROCESSING LETTERS, 2012, 112 (23) : 899 - 902
  • [43] Balanced edge colorings
    Balister, PN
    Kostochka, A
    Li, H
    Schelp, RH
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 90 (01) : 3 - 20
  • [44] Colorings of uniform hypergraphs with large girth
    Kupavskii, A. B.
    Shabanov, D. A.
    [J]. DOKLADY MATHEMATICS, 2012, 85 (02) : 247 - 250
  • [45] Harmonious and achromatic colorings of fragmentable hypergraphs
    Debski, Michat
    Lonc, Zbigniew
    Rzazewski, Pawei
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2017, 66 : 60 - 80
  • [46] Balanced allocation on hypergraphs
    Greenhill, Catherine
    Mans, Bernard
    Pourmiri, Ali
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2023, 138
  • [47] CLASS OF BALANCED HYPERGRAPHS
    FRANK, A
    [J]. DISCRETE MATHEMATICS, 1977, 20 (01) : 11 - 20
  • [48] Large monochromatic components in colorings of complete hypergraphs
    Lichev, Lyuben
    Luo, Sammy
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2024, 205
  • [49] Improved algorithms for colorings of simple hypergraphs and applications
    Kozik, Jakub
    Shabanov, Dmitry
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 116 : 312 - 332
  • [50] On general two-colorings of uniform hypergraphs
    Rozovskaya, A. P.
    [J]. DOKLADY MATHEMATICS, 2009, 80 (03) : 837 - 839
12345