论文信息 - Coloring Nearly-Disjoint Hypergraphs with n+o(n) Colors

Coloring Nearly-Disjoint Hypergraphs with n+o(n) Colors

Abstract It is shown that the chromatic index of a nearly-disjoint hypergraph on n vertices is at most n + o ( n ). This is an approximate version of the well-known conjecture of Erdős, Faber, and Lovasz stating that the chromatic index is at most n .

Jeff Kahn | J. Kahn

[1] Paul D. Seymour,et al. A fractional version of the Erdős-Faber-Lovász conjecture , 1992, Comb..

[2] Neil Hindman,et al. On a Conjecture of Erdös, Faber, and Lovász about n-Colorings , 1981, Canadian Journal of Mathematics - Journal Canadien de Mathematiques.

[3] Vojtech Rödl,et al. On a Packing and Covering Problem , 1985, Eur. J. Comb..

[4] Paul Erdös,et al. On the combinatorial problems which I would most like to see solved , 1981, Comb..

[5] Eugene L. Lawler,et al. Edge coloring of hypergraphs and a conjecture of ErdÖs, Faber, Lovász , 1988, Comb..

[6] Vojtech Rödl,et al. Near Perfect Coverings in Graphs and Hypergraphs , 1985, Eur. J. Comb..

[7] Béla Bollobás,et al. A new upper bound for the list chromatic number , 1989, Discret. Math..

[8] Joel H. Spencer,et al. Asymptotic behavior of the chromatic index for hypergraphs , 1989, J. Comb. Theory, Ser. A.

[9] Paul D. Seymour,et al. Packing nearly-disjoint sets , 1982, Comb..

[10] Béla Bollobás,et al. List-colourings of graphs , 1985, Graphs Comb..

[11] P. Erdos-L Lovász. Problems and Results on 3-chromatic Hypergraphs and Some Related Questions , 2022 .