论文信息 - On the Problem of Erdos and Hajnal in the Case of List Colorings

On the Problem of Erdos and Hajnal in the Case of List Colorings

Abstract We deal with the classical problem of Erdős and Hajnal in hypergraph theory and its generalization concerning the list colorings of hypergraphs. Let m ( n , k ) ( m list ( n , k ) ) denote the minimum number of edges in an n-uniform hypergraph with chromatic (list chromatic) number k + 1 . We obtained some new lower bounds for m ( n , k ) and m list ( n , k ) which improved previous results for some values of parameters n and k.

Anastasia P. Rozovskaya | Dmitry A. Shabanov | D. Shabanov | A. P. Rozovskaya

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

[2] Alexandr V. Kostochka,et al. Coloring uniform hypergraphs with few colors , 2004, Random Struct. Algorithms.

[3] Alexandr V. Kostochka,et al. Color-Critical Graphs and Hypergraphs with Few Edges: A Survey , 2006 .

[4] de Ng Dick Bruijn. A combinatorial problem , 1946 .

[5] Aravind Srinivasan,et al. Improved bounds and algorithms for hypergraph two-coloring , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

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

[7] Noga Alon,et al. Hypergraphs with high chromatic number , 1985, Graphs Comb..

[8] Andras Hajnal,et al. On a property of families of sets , 1964 .

[9] P. Erdos. On a combinatorial problem. II , 1964 .