,然後重複採用梅切爾斯基(英语:Mycielskian)構造法(格勒奇圖亦是以此法可得),即得任意大色數而無三角形的圖。埃尔德什·帕尔最先用概率方法(英语:probabilisticmethod)證明一般的結論: 取 n {\displaystyle n} 個頂點的随机图,每兩點之間各自獨立地以 n ( 1 − g ) /
(原始内容存档于2016-05-29). Michael Molloy; Bruce Reed. Graph Colouring and the ProbabilisticMethod illustrated. Springer Science & Business Media. 2002: 3 [2015-09-22]
Algorithms, Probabilistic and Experimental Methodologies. Proceedings of the International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental