[1] |
P. Erdös, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292 – 294. · Zbl 0032.19203 |
[2] |
P. Erdős, On the number of complete subgraphs contained in certain graphs, Magyar Tud. Akad. Mat. Kutató Int. Közl. 7 (1962), 459 – 464 (English, with Russian summary). · Zbl 0116.01202 |
[3] |
P. Erdős and M. Simonovits, A limit theorem in graph theory, Studia Sci. Math. Hungar 1 (1966), 51 – 57. · Zbl 0178.27301 |
[4] |
A. W. Goodman, On sets of acquaintances and strangers at any party, Amer. Math. Monthly 66 (1959), 778 – 783. · Zbl 0092.01305 · doi:10.2307/2310464 |
[5] |
Frank Harary, Graph theory, Addison-Wesley Publishing Co., Reading, Mass.-Menlo Park, Calif.-London, 1969. · Zbl 0182.57702 |
[6] |
J. W. Moon and L. Moser, On chromatic bipartite graphs, Math. Mag. 35 (1962), 225 – 227. · Zbl 0107.25001 · doi:10.2307/2688555 |
[7] |
F. P. Ramsey, On a problem of formal logic, Proc. London Math. Soc. 30 (1930), 264-286. · JFM 55.0032.04 |
[8] |
Gary Chartrand and Seymour Schuster, On the existence of specified cycles in complementary graphs, Bull. Amer. Math. Soc. 77 (1971), 995 – 998. · Zbl 0224.05121 |