On the construction of 3-chromatic hypergraphs with few edges
Author:
- 30 September 2013
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 120 (7) , 1483-1490
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Improvement of the lower bound in the Erdös-Hajnal combinatorial problemDoklady Mathematics, 2009
- Greedy colorings of uniform hypergraphsRandom Structures & Algorithms, 2009
- Hypergraph colouring and the Lovász Local LemmaDiscrete Mathematics, 1997
- Graph coloring problemsChoice Reviews Online, 1995
- The even cycle problem for directed graphsJournal of the American Mathematical Society, 1992
- An algorithmic approach to the Lovász local lemma. IRandom Structures & Algorithms, 1991
- Every 8-uniform 8-regular hypergraph is 2-colorableGraphs and Combinatorics, 1988
- On a combinatorial problem. IIActa Mathematica Hungarica, 1964
- Ein kombinatorisches Problem von P. Erdős und A. HajnalActa Mathematica Hungarica, 1964
- On a Combinatorial Problem of Erdös and HajnalCanadian Mathematical Bulletin, 1964