Abstract
Motivated by the Erdos-Faber-Lovász (EFL) conjecture for hypergraphs, we consider the edge coloring of linear hypergraphs. We discuss several conjectures for coloring linear hypergraphs that generalize both EFL and Vizing's theorem for graphs. For example, we conjecture that in a linear hypergraph of rank 3, the edge chromatic number is at most 2 times the maximum degree unless the hypergraph is the Fano plane where the number is 7. We show that for fixed rank sufficiently large and sufficiently large degree, the conjectures are true.
Subject
General Environmental Science
Reference7 articles.
1. Hypergraph Seminar (C. Berge and D. Ray-Chaudhuri, eds. ), Vol 411, Lecture Notes in Mathematics, New York, (1974).
2. V. Faber, The Erdős-Faber-Lovász conjecture – the uniform regular case, J. Combinatorics, 1(2) (2010) 113-120.
3. C. Berge, Hypergraphs: Combinatorics of Finite Sets, Vol. 45, North-Holland Mathematical Library, (1989).
4. P. Erdős, V. Faber, F. Jones, Projective -designs, J. Stat. Plan. Inference. 7 (1982) 181-191.
5. N. Alon, M. Krivelevich, B. Sudakov, Coloring graphs with sparse neighborhoods, J. Comb. Theory, B. 77(1) (1999) 73-82.