论文信息 - Colorings of b-simple hypergraphs

Colorings of b-simple hypergraphs

Abstract The paper deals with an extremal problem concerning colorings of hypergraphs with bounded edge degrees. Consider the family of b-simple hypergraphs, in which any two edges do not share more than b common vertices. We prove that for n ≥ n 0 ( b ) , any n-uniform b-simple hypergraph with the maximum edge degree at most c n r n − b is r-colorable, where c > 0 is an absolute constant.

Dmitry A. Shabanov | Margarita Akhmejanova

[1] Dmitry A. Shabanov,et al. Improved algorithms for colorings of simple hypergraphs and applications , 2016, J. Comb. Theory, Ser. B.

[2] Jakub Kozik,et al. Multipass greedy coloring of simple uniform hypergraphs , 2013, Random Struct. Algorithms.

[3] Zoltán Szabó. An Application of Lovász's Local Lemma - A New Lower Bound for the van der Waerden Number , 1990, Random Struct. Algorithms.

[4] Jakub Kozik,et al. A note on random greedy coloring of uniform hypergraphs , 2013, Random Struct. Algorithms.

[5] Dmitry A. Shabanov,et al. Colorings of hypergraphs with large number of colors , 2016, Discret. Math..

[6] András Pluhár,et al. Greedy colorings of uniform hypergraphs , 2009 .

[7] Vojtech Rödl,et al. Constructions of sparse uniform hypergraphs with high chromatic number , 2010, Random Struct. Algorithms.

[8] V. Rödl,et al. Constructions of sparse uniform hypergraphs with high chromatic number , 2010 .

[9] Aravind Srinivasan,et al. Improved bounds and algorithms for hypergraph 2-coloring , 2000, Random Struct. Algorithms.

[10] A. Raigorodskii,et al. The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems , 2011 .

[11] Alexandr V. Kostochka,et al. Coloring uniform hypergraphs with few edges , 2009 .