Upper bounds on the height difference of the Gaussian random field and the range of random graph homomorphisms into ℤ

On some simple degree conditions that gu

On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs

✍ Vu, Van H. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB 👁 2 views

It is well known that almost every graph in the random space G(n, p) has chromatic number of order O(np/ log(np)), but it is not clear how we can recognize such graphs without eventually computing the chromatic numbers, which is NP-hard. The first goal of this article is to show that the above-menti