Greedy colorings of uniform hypergraphs
Author:
- 10 February 2009
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 35 (2) , 216-221
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Coloring uniform hypergraphs with few colorsRandom Structures & Algorithms, 2003
- The Probabilistic Method2000
- Improved bounds and algorithms for hypergraph 2-coloringRandom Structures & Algorithms, 2000
- The even cycle problem for directed graphsJournal of the American Mathematical Society, 1992
- Every 8-uniform 8-regular hypergraph is 2-colorableGraphs and Combinatorics, 1988
- Coloring n-sets red and blueJournal of Combinatorial Theory, Series A, 1981
- On 3-chromatic hypergraphsDiscrete Mathematics, 1978
- On a combinatorial problem of P. Erdös and L. LovászDiscrete Mathematics, 1977
- On a combinatorial problem. IIActa Mathematica Hungarica, 1964
- Ein kombinatorisches Problem von P. Erdős und A. HajnalActa Mathematica Hungarica, 1964