On a probabilistic graph-theoretical method

Jaroslav Nešetřil, Vojtěch Rödl

Proceedings of the American Mathematical Society · 1978 · 60 citations · 4 references

DOIFull text

Open access

Concepts

Abstract

We introduce a method by means of which one can simply prove the existence of sparse hypergraphs with large chromatic number. Moreover this method gives the full solution of an Erdös-Ore problem.

References

4