The mathematical coloring book: Mathematics of coloring and the colorful life of its creators

The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators

Volumn , Issue , 2009, Pages 1-607

  Soifer, Alexander ^a   Grünbaum, Branko ^b   Johnson Jr , Peter D ^c   Rousseau, Cecil ^d  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF WASHINGTON   (United States)

^c AUBURN UNIVERSITY   (United States)

^d UNIVERSITY OF MEMPHIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84887863290     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-0-387-74642-5     Document Type: Book

References (683)

1. Abbott, H. L., Some Problems in Combinatorial Analysis, Ph. D. thesis, University of Alberta, Canada, March, 1965.
2. Abbott, T. K., Catalogue of the Manuscripts in the Library of Trinity College, Dublin to which is added a List of Fagel Collection of Maps in the same Library. Hodges, Figgis, & Co, Dublin, 1900.
3. Abbott, H. L., and Zhou, B., On small faces in 4-critical graphs. Ars Combin. 32(1991), 203-207.
4. Abelin-Schur, H., Talk at Schur-Gedenkkolloquium at at the Humboldt University, Berlin, November 15, 1991, manuscript.
5. Abelin-Schur, H., Phone conversation of May 18, 1995.
6. Aksionov, V. A., On continuation of 3-coloring of planar graph (Russian). Diskret. Analiz. 26(1974), 3-19.
7. Aksionov, V. A., and Mel'nikov, L. S., Some Counter examples Associated with the Three-Color Problem, J. Combin. Theory, Series B 28(1980), 1-9.
8. Alexeev, B., Fox, J., and Graham, R. L., On minimal colorings without monochromatic solutions to a linear equation, Combinatorial Number Theory: Dedicated to Professor Ron Graham on the Occasion of His Seventieth Birthday. Walter de Gruyter, Berlin, 2007, 1-22.
9. Appel, K., and Haken, W., The existence of unavoidable sets of geographically good configurations. Illinois J. Math. 20(1976), 218-297.
10. Appel, K., and Haken, W., The solution of the four-color map problem. Sci. Am. 237(4) (Oct. 1977), 108-121.
11. Appel, K., and Haken, W., Every planar map is four colorable. Part I. Discharging. Illinois J. Math. 21(1977), 429-490.
12. Appel, K., Haken, W., and Koch, J., Every planar map is four colorable. Part II. Reducibility. Illinois J. Math., 21(1977), 491-567.
13. Appel, K., and Haken, W., Every Planar Map is Four Colorable. Amer. Math. Soc., Providence, 1989.
14. Arnautov, V. I., Nediskretnaya Topologizuemost Schetnykh Kolets, (Russian). Dokl. Akad. Nauk SSSR 191 (1970) 747-750.
15. English Translation: Nondiscrete topologizability of countable rings. Soviet Math. Dokl. 11(1970), 423-426.
16. Arrias, E., In Memoriam Prof. P. J. H. Baudet. Eigen. Haard. 48(5) (Jan. 28, 1928), 92-94.
17. Baker, H., and Oliver, E., Ericas in Southern Africa. Purnell, Cape Town.
18. Banach, S., and Tarski, A., Sur la décomposition des ensembles de points en parties respectivement congruentes. Fundamenta Mathematicae 6(1924), 244-277.
19. Baudet, P. J. H., Groepentheoretische onderzoekingen (doctoral dissertation). Martinus Nijhoff, The Hague, 1918.
20. Baudet, P. J. H., Het Limietbegrip (inaugural address at Delft). P. Noordhoff, Groningen, 1919.
21. Baudet, P. J. H., Een nieuwe theorie van onmeetbare getallen. Christiaan Huygens I (1921/1922), 33-47.
22. Baudet, P. J. H., Een stelling over rekenkundige reeksen van hoogere orde. Christiaan Huygens I (1921/1922), 146-149 (published posthumously).
23. Baudet, P. J. H., Gelijktijdige invoering der negatieve en imaginaire getallen. Christiaan Huygens I (1921/1922), 226-231 (published posthumously by J. Teixeira de Mattos and F. Schuh on the basis of a lecture and notes by Baudet).
24. Baudet, letter to A. Soifer of August 24, 1995.
25. Baudet, H., letter to A. Soifer of October 17, 1995.
26. Baudet, H., letter to A. Soifer of November 27, 1995.
27. Baudet, H., letter to A. Soifer of December 18, 1995.
28. Baudet, H., letter to A. Soifer of January 29, 1996.
29. Baudet, H., letter to A. Soifer of February 15, 1996.
30. Baudet, H., letter to A. Soifer of March 6, 1996.
31. Baudet, H., letter to A. Soifer of March 23, 1996.
32. Baudet, H., letter to A. Soifer of April 7, 1996.
33. Baudet, H., letter to A. Soifer of April 18, 1996.
34. Baudet, H., letter to A. Soifer of May 10, 1996.
35. Baudet, H., letter to A. Soifer of May 27, 1996.
36. Baudet, H., letter to A. Soifer of June 12, 1996.
37. Beineke, L. W., and Wilson, R. J., On the edge-chromatic number of a graph, Discrete Math. 5(1973), 15-20.
38. Behzad, M., Graphs and Their Chromatic Numbers, Ph. D. Thesis, Michigan State University, Michigan, USA, 1965.
39. Behzad, M., and Chartrand, G., An introduction to total graphs. In P. Rosenstiehl (ed.), Theory of Graphs. International Symposium, Rome. July 1966, Gordon and Breach, New York, 1967, 31-33.
40. Behzad, M., and Chartrand, G., Introduction to the Theory of Graphs. Allyn and Bacon, Boston, 1971.
41. Behzad, M., Chartrand, G., and Lesniak-Foster, L., Graphs & Digraphs. Prindle, Weber & Schmidt, Boston, 1979.
42. Belov, A. Ya., and Okhitin, S. B., Ob Odnoj Kombinatornoj Zadaze (On One Combinatorial Problem). Uspekhi Mat. Nauk 48(2) (1993), 169-170, (Russian).
43. Benda, M., and Perles, M., Colorings of metric spaces. Geombinatorics IX (3) (2000), 113-126.
44. Bergelson, V., and Leibman, A., Polynomial Extension of van der Waerden's and Szemerédi's theorems. J. Amer. Math. Soc. 9(1996), 725-753.
45. Bergelson, V., Multiplicatively large sets and ergodic ramsey theory. Israle J. Math. 148(2005), 23-40.
46. Berhhart, A., Six-rings in minimal five-color maps, Amer. J. Math. 69(1947), 391-412.
47. Berhhart, A., Another reducible edge configuration, Amer. J. Math. 70(1948), 144-146.
48. Berlekamp, E. R., A construction for partitions which avoid long arithmetic progressions. Canad. Math. Bull. 11(1969), 409-414.
49. Bernays, P., A system of axiomatic set theory III, J. Symbolic Logic 7(1942), 65-89.
50. Bertsch, S. M., Nobel Prize Women in Science: Their Lives, Struggles, and Momentous Discoveries. Carol Pub., Secaucus, N. J., 1993.
51. Biggs, N. L., De Morgan on map colouring and the separation axiom, Archive Hist. Exact. Sci. 28(1983), 165-170.
52. Biggs, N. L., Lloyd, E. K., and Wilson, R. J., Graph Theory 1736-1936, Clarendon Press, Oxford, 1976. Latest version: reprinted with corrections, 1998.
53. Birkhoff, G. D., The reducibility of maps. Amer. J. Math. 35(1913), 114-128.
54. Boltyanski, V., and Soifer, A., Geometric Etudes in Combinatorial Mathematics. Center for Excellence in Mathematical Education, Colorado Springs, 1991.
55. Bóna, M., and Tóth, G., A Ramsey-type problem on right-angled triangles in space. Discrete Math. 150(1996), 61-67.
56. Borodin, O. V., Structural properties of plane graphs without adjacent triangles and an application to 3-colorings. J. Graph Theory 21(2) (1996), 183-186.
57. Borodin, O. V., and Raspaud, A., A sufficient condition for planar graphs to be 3-colorable. J. Combin. Theory Ser. B 88(2003), 17-27.
58. Borodin, O. V., Glebov, A. N., Raspaud, A., and Salavatipour, M. R., Planar graphs without cycles of length from 4 to 7 are 3-colorable. J. Combin. Theory Ser. B 93(2005), 303-311.
59. Borodin, O. V., Glebov, A. N., Jensen, T. R., and Raspaud, A., Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable. Sib. Electron. Mat. Rep. 3(2006), 428-440.
60. Brass, P., Moser, W., and Pach, J., Research Problems in Discrete Geomtery. Springer, New York, 2005.
61. Brauer, A., Brauer, R., and Hopf, H, Über dies Irreduzibilität einigen spezieller Klassen von Polynomen. Jahresber. Deutsch. Math.-Verein. 35(1926), 99-112.
62. Brauer, A., Über Sequenzen von Potenzresten, Sitzunberichte de Preussischen Akademie der Wissenschaften, Physicalisch-Mathematische Klasse. Berlin, 1928, 9-16.
63. Brauer, A., Combinatorial Methods in the Distribution of kth Power Residues. Combinatorial Mathematics and its Applications; Proceedings of the Conference, University if North Carolina, Wilmington, 1969, 14-37.
64. Brauer, A., Gedenkrede auf Issai Schur, in Issai Schur. Gesammelte Abhandlungen, vol. 1, Springer, Berlin, 1973, v-xiv.
65. Brauer, H., Memories, 114 pages, manuscript.
66. Brauer, R., Collected Papers, vol's I, II, and III, MIT Press, Cambridge, Massachusetts, vy1980.
67. Brooks, R. L., On Colouring the nodes of a network, Proc. Cambridge Philos. Soc. 37(1941), 194-197.
68. Brown, J. I., and Rödl, V., Folkman numbers for graphs of small order. Ars Combin. 35(A) (1993), 11-27.
69. Brown, N., Dunfield, N., and Perry, G., Colorings of the Plane I. Geombinatorics III (2) (1993), 24-31.
70. Brown, N., Dunfield, N., and Perry, G., Colorings of the Plane II. Geombinatorics III (3) (1993), 64-74.
71. Brown, N., Dunfield, N., and Perry, G., Colorings of the Plane III. Geombinatorics III (4) (1993), 110-114.
72. Bruijn, N. G. de, Letter to P. Erdõs, August 18, 1947.
73. Bruijn, N. G. De, and Erdõs, P., On a combinatorial problem. Indagationes Math. 10(1948), 421-423.
74. Bruijn, N. G. De, and Erdõs, P., A colour problem for infinite graphs and a problem in the theory of relations. Indagationes Math. 13(1951), 369-373.
75. Bruijn, N. G. De, Letter to B. L. van der Waerden, March 29, 1977.
76. Bruijn, N. G. De, Commentary (on B. L. Van der Waerden's article [Wae2]). In E. M. J. Berin et al. (eds), Two Decades of Mathematics in the Netherlands, 1920-1940, Mathematical Centre, Amsterdam, 1978, Part I, 116-124.
77. Brüning, J., Ferus, D., and Siegmund-Schultze, R., Terror and Exile: Persecution and Expulsion of Mathematicians from Berlin between 1933 and 1945. Deutsche Mathematiker-Vereinigung, Berlin, 1998.
78. Bukh, B., Measurable sets with excluded distances, manuscript, 22pp, January 25, 2007.
79. Burkill, H., and Mirsky, L., Monotonicity. J. Math. Anal. and Appl. 41(1973), 391-410.
80. Calkin, N. J., Erdõs, P., and Tovey, C. A., New Ramsey bounds from cyclic graphs of prime order. SIAM J. Discrete Math. 10(1997), 381-387.
81. Cantwell, K., Finite euclidean ramsey theory. J. Combin. Theory Ser. A 73(2), (1996), 273-285.
82. Cantwell, K., All regular polytopes are Ramsey, J. Combin. Theory Ser. A 114(2007), 555-562.
83. Cayley, A., Report of meeting, 13 June 1878, in Proceedings of the London Mathematical Society, IX, C. F. Hodgson & Son, Gough Square, London, 1878, 148.
84. Cayley, A., Report of meeting, 13 June 1878, in Nature, XVIII, MacMillan and CO., London, 1878, 204.
85. Cayley, A., On the Colouring of Maps, in Proceedings of the Royal Geographical Society. London, 1879, 259-261.
86. Charttrand, G., and Lesniak, L., Graphs & Digraphs, 4th ed., Chapman & Hall/CRC, Boca Raton, 2005.
87. Chen, M., Raspaud, A., and Wang, W., Three-coloring planar graphs without short cycles. Information Processing Letters 101(2007), 134-138.
88. Chetwynd, A. G., Total colourings of graphs - A progress report. In Alavi, Y. et al. (ed.), Graph Theory, Combinatorics, and Applications, Proceedings of the Sixth Quadrennial Conference on Graph Theory and Appplications of Graphs, 1988, vol. 1, 233-244, Wiley, New York, 1991.
89. Chilakamarri, K. B., Unit-distance graphs in rational n-spaces. Discrete Math. 69(1988), 213-218.
90. Chilakamarri, K. B., On the chromatic number of rational five-space. Aequationes Math. 39(1990), 146-148.
91. Chilakamarri, K. B., Unit-distance graphs in Minkowski metric spaces. Geometriae Dedicata 37(1991), 345-356.
92. Chilakamarri, K. B., The unit-distance graph problem: A brief survey and some new results. Bulletin of the ICA 8(1993), 39-60.
93. n, (manuscript).
94. Chilakamarri, K. B., A 4-Chromatic unit-distance graph with no triangles. Geombinatorics IV (3), (1995), 64-76.
95. Chung, F., and Graham, R. L., Forced convex n-gons in thye plane. Discrete and Computational Geometry 19(1998), 3677-371.
96. n (manuscript).
97. Chowla, S., There exists an infinity of 3-combinations of primes in A. P. Lahore Philos. Soc. 6(2) (1944), 15-16.
98. Church, A., and Paul, J., Cohen and the Continuum Problem. In Petrovsky, I. G. (ed), Proceedings of International Congress of Mathematicians (Moscow - 1966), Mir, Moscow, 1968, 15-20.
99. Chvátal, V., Some unknown van der Waerden numbers, in Combinatorial Structures and their Applications. Gordon and Breech, New York, 1969, 31-33.
100. Chvátal, V., and Harary, F., Generalized Ramsey theory for graphs. Bull. Amer. Math. Soc. 78(1972), 423-426.
101. Cibulka, J., On the Chromatic Number of Real and Rational Spaces, to appear in October 2008 in Geombiniatorics XVIII (2).
102. Cohen P. J., The independence of the continuum hypothesis, Proceeding of the National Academy of Science, USA, part I: 50(1963), 1143-1148; part II: 51(1964), 105-110.
103. Cohen, P. J., Set Theory and the Continuum Hypothesis. Benjamin/Cummings Reading, Massachusetts, 1966.
104. Conway, J. H., and Sloane, N. J. A., Sphere packings, lattices and groups. 3rd ed., with contrib. by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov, Springer-Verlag, New York, 1999.
105. Coulson, D., An 18-colouring of 3-space omitting distance one. Discrete Math. 170(1-3) (1997), 241-247.
106. Coulson, D., A 15-colouring of 3-space omitting distance one. Discrete Math. 256(1-2) (2002), 83-90.
107. Coulson, D., Tilings and Colourings of 3-Space. Geombinatorics XII (3) (2003), 102-116.
108. Courant, R., Reminiscences from Hilbert's Göttingen, Mathematical Intelligencer 3(1981), 154-164.
109. Cox, J., Letter to A. Soifer dated November 21, 1991.
110. Coxeter, H. S. M., Map-coloring problems, Scripta Math. 23(1958), 11-25.
111. Coxeter, H. S. M., The four-color map problem, 1840-1890, Math. Teacher 52(1959), 283-289.
112. Croft, H. T., Incidence incidents. Eureka (Cambridge) 30(1967), 22-26.
113. Croft, H. T., Falconer, K. J., and Guy, R. K., Unsolved Problems in Geometry, Springer, New York, 1991.
114. Csizmadia, G., and Tóth, G., Note on a Ramsey-type problem in geometry. J. Combin. Theory, Ser. A 65(2) (1994), 302-306.
115. Dalen, D. Van, Mystic, Geometer, and Intuitionist: The Life of L. E. J. Brouwer, Volume I: The Dawning Revolution, 1999, Oxford University Press, Oxford.
116. Dalen, D. Van, Mystic, Geometer, and Intuitionist: The Life of L. E. J. Brouwer, Volume II: Hope and Disillusion, 2005, Oxford University Press, Oxford.
117. Danzer, L., Grünbaum, B., and Klee, V., Helly's Theorem and its Relatives, Amer. Math. Soc., Providence, 1963.
118. Delahaye, J.-P., Coloriages irréals, Pour la Science, Février 2005, 88-93.
119. English translation: Imaginary Coloring. Geombinatorics XV (3) (2006), 101-119.
120. Delannoy, H., and Ramsey, A. S., Réponse à question 51, Interméd. Math. 1(1894), 192.
121. De Morgan, A., Letter to W. R. Hamilton, October 23, 1852; TCD MS 1493, 668; Trinity College Dublin Library, Manuscripts Department.
122. 125.
123. 111.
124. De Morgan, A., Review of the philosophy of discovery..., The Athenaeum 1694, London, 1860, 501-503.
125. De Morgan, A., Correspondence to Sir Herschel, in Memoir of Augustus De Morgan, by his wife S. E. De Morgan, Longmans, Green, and Co., London, 1882, 333.
126. Descartes, B., A three-colour problem. Eureka 9, April, 21, 1947.
127. Descartes, B., A three-colour problem, Solutions to Problems in Eureka No. 9, Eureka 10, March 24, 1948.
128. Descartes, B., Advanced Problems and Solutions: Solution of problem 4526, Amer. Math. Monthly 61(5) (1954), 352-353.
129. Dickson, L. E., On the Last Theorem of Fermat. Quart. J. Pure Appl. Math. 40(1908), 27-45.
130. Dickson, L. E., History of the Theory of Numbers, vols 1(1919), 2(1920), 3(1923), Carnegie Institution of Washington, Washington, DC.
131. Diestel, R., Graph Theory, 2nd ed., Springer-Verlag, New York, 2000.
132. Dirac, G. A., A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc. 27(1952), 85-92.
133. Dold-Samplonius, Bartel Leendert van der Waerden befragt von Yvonne Dold-Samplonius, NTM, International Journal of History and Ethics of Natural Sciences, Technology and Medecine, 2(1994), 129-147.
134. English translation: Interview with Bartel Leendert van der Waerden, Notices of the Amer. Math. Soc. 44(3) (1997), 313-320.
135. Dold-Samplonius, In Memoriam: Bartel Leendert van der Waerden (1903-1996). Historia Mathematica 24(1997), 125-130.
136. Dreyer, C. Th., Thoughts on My Métier (1943), translated by Skoller, D., Gyldendal Boghandel, Nordisk Forlag A/S, Conpenhagen, 1973.
137. Dumitrescu, A., A Remark on the Erdõs-Szekeres Theorem, Amer. Math. Monthly 112(10), (2005) 921-924.
138. Dummit, D. S., and Foot, R. M., Abstract Algebra, 2nd ed., Wiley & Sons, New York, 1999.
139. Duparc, H. J. A., Handwritten recollection notes for A. Soifer, Delft, September, 1996.
140. Dye, D. S., A Grammar of Chinese Lattice, Harvard-Yenching Institute, Harvard Univ. Press, Cambrige, Mass., 1937.
141. Dynkin, E. B., and Uspenskii, V. A., Matematicheskie Besedy, Gosudarstvennoe Izdatel'stvo Tekhniko-Teoreticheskoy Literatury, Moscow, 1952 (Russian). Partial English translation (part 1 of three only): Multicolor Problems, D. C. Heath & Co., Boston, 1963.
142. Einstein, A., Geometry and Experience, a lecture before the Prussian Academy of Sciences, January 27, 1921, In Seelig, C. (ed.), Ideas and Opinions by Albert Einstein, Crown, New York, 1954.
143. Einstein, A. (author), Schillp, P. A. (ed.), Albert Einstein: Philosopher-Scientist. Open Court, La Salle, 1970.
144. Eisenreich, G. B. L., Van der Waerden Wirken von 1931 bis 1945 in Leipzig, in 100 Jahre Mathematisches Seminar der Karl-Marx-Universität Leipzig. Beckert, H., and Schumann, H. (eds.), VEB Deutscher Verlag der Wissenschaften, Berlin, 1981.
145. Erdõs, P., Some set-theoretical properties of graphs. Revista de la Univ. Nac. de Tucumán, Ser A. Mat. y Fis. Teó r., 3(1942), 363-367.
146. Erdõs, P., Letter to N. G. de Bruijn, August 4, 1947.
147. κ + p and some related problems, Summa Brasil. Math. 2(1950), 113-124.
148. Erdõs, P., A colour problem for infinite graphs and a problem in the theory of relations. Proc. Konink. Nederl. Akad. Wetensch. Amsterdam 54(1951), 371-373.
149. Erdõs, P., Egy kongruenciarendszerekröl szóló problémáról (On a problem concerning covering systems). Mat. Lapok 3(1952), 122-128 (Hungarian).
150. Erdõs, P., Some unsolved problems. Michigan Math. J. 4(1957), 291-300.
151. Erdõs, P., Graph theory and probability. Canad. J. Math. 11(1959), 34-38.
152. Erdõs, P., On sets of distances of n points in Euclidean space. MTA MKI Közl. 5(1960), 165-169.
153. Erdõs, P., Graph theory and probability II. Canad. J. Math. 13(1961), 346-352.
154. Erdõs, P., Nekotorye Nereshennye Problemy (Some unsolved problems), Matematika 7(4) (1963), 109-143. (A Russian translation of [E61.22])
155. Erdõs, P., Some Unsolved Problems, Magyar tudomanyos akademia mathematikai kutato intezetenek közlemenyel 6 ser. A (1-2) (1961), 221-254.
156. Erdõs, P., On the application of combinatorial analysis to number theory, geometry and analysis. Actes du Congrès International des Mathematiciens (Nice, 1970), Tome 3, Gauthier-Villars, Paris, 1971, 201-210.
157. Erdõs, P., Problems and results on combinatorial number theory. A survey of combinatorial theory (Proc. Internat. Sympos., Colorado State Univ., Fort Collins, Colorado, 1971), 117-138, North-Holland, Amsterdam, 1973.
158. Erdõs, P., On some problems of elementary and combinatorial geometry. Annali Matematica Pura Applicata, 103(4) (1975), 99-108.
159. Erdõs, P., Problems and results on finite and infinite graphs. Recent Advances in Graph Theory (Proc. Second Czechoslovak Sympos., Prague, 1974), 183-192, Academia, Prague, 1975.
160. Erdõs, P., Problems and results in combinatorial analysis. Colloquio Internacionale sulle Teorie Combinatorie (Rome, 1973), Tomo II, Atti dei Convegni Lincei, No. 17, pp. 3-17, Accad. Naz. Lincei, Rome, 1976.
161. Erdõs, P., Some problems on elementary geometry, Austr. Math. Soc. Gaz., 2(1975), 2-3.
162. Erdõs, P., Problem (p. 681);
163. P. Erdõs, Chairman, Unsolved Problems, in Proceedings of the Fifth British Combinatorial Conference 1975, University of Aberdeen, July 14-18, 1975, C. St. J. A. Nash-Williams and J. Sheehan, (eds.), Congressus Numerantium XV, Winnipeg, Utilitas Mathematica, 1976.
164. Erdõs, P., Problems and results on combinatorial number theory, II. J. Indian Math. Soc. (N. S.) 40(1-4) (1976), 285-298, 1977.
165. Erdõs, P., 1977.28 Problems in number theory and Combinatorics. Proceedings of the Sixth Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man., 1976)
166. Congress. Numer. XVIII, 35-58, Utilitas Math., Winnipeg, Man., 1977.
167. Erdõs, P., Problem 28 in "Exercises, Problems and Conjectures", Bollobás, B., Extremal Graph Theory, London Mathematical Society Monographs, Academic Press, 1978, p. 285.
168. Erdõs, P., Combinatorial problems in geometry and number theory. Relations between combinatorics and other parts of mathematics, Proc. Sympos. Pure Math., Ohio State Univ., Columbus Ohio (1978);
169. Proc. Sympos. Pure Math., XXXIV, Amer. Math. Soc., Providence, RI (1979), 149-162.
170. Erdõs, P., A survey of problems in combinatorial number theory. Combinatorial Mathematics, Optimal Designs and their Applications (Proc. Sympos. Combin. Math. and Optimal Design, Colorado State Univ., Fort Collins, Colo., 1978), Ann. Discrete Mathematics 6(1980), 89-115.
171. Erdõs, P., Some combinatorial problems in geometry. Geom. & Diff. Geom. Proc., Haifa, Israel, (1979);
172. Lecture Notes in Math., 792, Springer (1980), 46-53.
173. Erdõs, P., Some combinational problems in Geometry. Geometry and Differential Geometry (Proc. Conf., Univ. Haifa, Haifa, 1979), Lecture Notes in Math., 792, pp. 46-53, Springer, Berlin, 1980.
174. Erdõs, P., On the combinatorial problems which I would most like to see solved. Combinatorica 1(1981), 25-42.
175. Erdõs, P., Problems and results in graph theory. The Theory and Application of Graphs (Kalamazoo, Mich., 1980), Wiley, New York, 1981, 331-341.
176. Erdõs, P., Some applications of graph theory and combinatorial methods to number theory and geometry, Algebraic Methods in Graph Theory (Colloq. held in Szeged, Hungary 1978), vol. I, Coll. Math Soc. J. Bolyai, 25(1981), 137-148.
177. Erdõs, P., Some new problems and results in graph theory and other branches of combinatorial mathematics. Combinatorics and Graph Theory, Proc. Symp. Calcutta 1980, Lecture Notes Math., 885, Springer (1981), 9-17.
178. Erdõs, P., My Scottish Book "problems", The Scottish Book. Mathematics from the Scotish Café, Birkhäuser, Boston, 1981, 35-43.
179. Erdõs, P., Some combinatorial problems in geometry, Geometry and Differential Geometry, Lecture Notes in Mathematics, 792, Springer-Verlag, Berlin (1983), 46-53.
180. Erdõs, P., Combinatorial problems in geometry, Math. Chronicle 12(1983), 35-54.
181. Erdõs, P., Problems and results in combinatorial geometry. Discrete Geometry and Convexity, Annals of the New York Academy of Sciences, 440, The New York Academy of Sciences, New York (1985), 1-11.
182. Erdõs, P., Some problems and results in number theory. Number Theory and Combinatorics, Japan 1984 (Tokyo, Okayama and Kyoto, 1984), World Sci. Publishing, Singapore, 1985, 65-87.
183. Erdõs, P., Some solved and unsolved problems of mine in number theory. Topics in Analytic Number Theory (Austin, Tex., 1982), Univ. Texas Press, Austin, TX, 1985, 59-75.
184. Erdõs, P., My joint work with Richard Rado. Surveys in Combinatorics 1987 (New Cross, 1987), London Math. Soc. Lecture Note Ser., 123, Cambridge Univ. Press, Cambridge-New York, 1987, 53-80.
185. Erdõs, P., Problems and results in combinatorial analysis and graph theory. Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, 1986), Discrete Math. 72(1-3) (1988), 81-92.
186. Erdõs, P., Problems and results on extremal problems in number theory, geometry, and combinatorics. Proceedings of the 7th Fischland Colloquium, (Wustrow, 1988), Rostock. Math. Kolloq., No. 38(1989), 6-14.
187. Erdõs, P., Some problems and results on combinatorial number theory, Graph theory and its applications: East and West (Jinan, 1986), Ann. New York Acad. Sci. 576, 132-145, New York Acad. Sci., New York, 1989.
188. Erdõs, P., Video recording of the talk "Some of My Favorite Problems II". University of Colorado at Colorado Springs, March 16, 1989.
189. Erdõs, P., Video recording of the talk "Some of My Favorite Problems II". University of Colorado at Colorado Springs, March 17, 1989.
190. Erdõs, P., An interview in documentary film. Colorado Mathematical Olympiad, 1989.
191. Erdõs, P., Problems and results on graphs and hypergraphs: similarities and differences. Mathematics of Ramsey Theory, Algorithms Combin., 5, 12-28, Springer, Berlin, 1990.
192. Erdõs, P., Problems and results in combinatorial analysis and combinatorial number theory, Graph theory, Combinatorics and Applications, vol. 1 (Kalamazoo, MI, 1988), Wiley-Intersci. Publ., Wiley, New York, 1991, 397-406.
193. Erdõs, P., Video recording of the talk "Some of My Favorite Problems I". University of Colorado at Colorado Springs, December 23, 1991.
194. Erdõs, P., Letter to A. Soifer of July 12, 1991.
195. Erdõs, P., Letter to A. Soifer of July 16, 1991.
196. Erdõs, P., Letter to A. Soifer of August 10, 1991.
197. Erdõs, P., Letter to A. Soifer of August 14, 1991.
198. Erdõs, P., Letter to A. Soifer, received on October 2, 1991 (marked "1977 VII 25").
199. Erdõs, P., Obituary of My Friend and Coauthor Tibor Gallai. Geombinatorics II (1) (1992), 5-6;
200. corrections: II (2) (1992), 37.
201. Erdõs, P., In memory of Tibor Gallai. Combinatorica 12(4) (1992), 373-374.
202. Erdõs, P., On some unsolved problems in elementary geometry (Hungarian). Mat. Lapok (N. S.) 2(2) (1992), 1-10.
203. Erdõs, P., Video recording of the talk "Some of My Favorite Problems II". University of Colorado at Colorado Springs, January 10, 1992.
204. Erdõs, P., Some of my favorite solved and unsolved problems in graph theory. Quaestiones Math. 16(3) (1993), 333-350.
205. Erdõs, P., Problems and results in discrete mathematics, Trends in discrete mathematics. Discrete Math. 136(1-3) (1994), 53-73.
206. Erdõs, P., Problems and results on set systems and hypergraphs. Extremal Problems for Finite Sets (Visegrád, 1991), Bolyai Soc. Math. Stud., 3, János Bolyai Math. Soc., Budapest, 1994, 217-227.
207. Erdõs, P., Some problems in number theory, combinatorics and combinatorial geometry. Math. Pannon. 5(2) (1994), 261-269.
208. Erdõs, P., Video recording of the talk "Twenty Five Years of Questions and Answers". 25th South-Eastern International Conference On Combinatorics, Graph Theory and Computing, Florida Atlantic University, Boca Raton, March 10, 1994.
209. Erdõs, P., Some of my favourite problems in number theory, combinatorics, and geometry. Combinatorics Week (Portuguese), São Paulo, 1994, Resenhas 2(1995), 165-186.
210. Erdõs, P., On the 120-th Anniversary of the Birth of Schur. Geombinatorics V (1) (1995), 4-5.
211. Erdõs, P., Interview with A. Soifer of March 7, 1995, Boca Raton, Florida.
212. Erdõs, P., Some of my favorite problems and results. The Mathematics of Paul Erdõs, vol. I, Graham, R. L., and Nesetril, J., (eds), 47-67, Springer, Berlin, 1997.
213. Erdõs, P., Some of my favourite unsolved Problems. Math. Japon. 46(3) (1997), 527-537.
214. Erdõs, P., Bollobás, B., and Catlin, P. A., Hadwiger's conjecture is true for almost every graph. European J. Comb., 1(3) (1980), 195-199.
215. Erdõs, P., and De Bruijn, N. G., A colour problem for infinite graphs and a problem in the theory of relations. Indag. Math. 13(1951), 371-373.
216. Erdõs, P., Harary, F., and W. T. Tutte, On the dimension of a graph. Mathematika, London, 12(1965), 118-122.
217. Erdõs, P., and Graham, R., Old and New Problems and Results in Combinatorial Number Theory: van der Waerden's Theorem and Related Topics. L'Enseignement Mathématique 25(3-4), 1979, 325-344.
218. Erdõs, P., and Graham, R., Old and New Problems and Results in Combinatorial Number Theory. L'Enseignement Mathématique, Université de Genève, 1980.
219. Erdõs, P., Graham, R. L., Montgomery, P., Rothschild, B. L., Spencer, J., and Straus, E. G., Euclidean Ramsey theorems I, II, and III. J. Combin. Theory Ser. A, 14(1973), 341-363;
220. Coll. Math. Soc. Janos Bolyai, 10 (1973) North Holland, Amsterdam (1975), 529-557 and 559-583.
221. Erdõs, P., and Hajnal, A., On Chromatic Numbers of Graphs and Set-Systems. Acta Mathematica Acad. Sci. Hungar. 17(1-2), 1966, 61-99.
222. Erdõs, P., and Hajnal, A., Research problem 2-5, J. Combin. Theory 2(1967), 104.
223. Erdõs, P., Marary, F. and Tutte, W. T., On the dimension of a graph, Mathematika 12(1965), 118-122.
224. Erdõs, P., and G. Purdy, Some extremal problems in geometry, III. Proc. Sixth Southeastern Conf. on Combinatorics, Graph Theory and Computing (Florida Atlantic Univ., Boca Raton, FL, 1975), Congressus Numerantium, XIV, Utilitas Math., Winnipeg, Manitoba, (1975), 291-308.
225. Erdõs, P., and Purdy, G., Some extremal problems in combinatorial geometry. In R. Graham, M. Grötschel and L. Lovász, (eds.), Handbook of Combinatorics, North Holland, Amsterdam, 1991.
226. Erdõs, P., and Purdy, G., Some Extremal Problems in Discrete Geometry (manuscript).
227. Erdõs, P., Sárközy, A., and Sós, V. T., On a conjecture of Roth and some related problems. I. Irregularities of Partitions (Fertöd, 1986), 47-59, Algorithms Combin. Study Res. Texts, 8, Springer, Berlin, 1989.
228. Erdos, P., and Simonovits, M., On the chromatic number of geometric graphs. Ars Comb., 9(1980), 229-246.
229. Erdos, P., and Suranyi, J., Válogatott Fejezetek a Számelmeletbol. Polygon, Szeged, 1996 (Hungarian).
230. Erdos, P., and Suranyi, J., Topics in the Theory of Numbers. Trans. from the Hungarian 2nd ed.[Esu1], Springer, New York, 2003.
231. Erdos, P., and Szekeres, G., A combinatorial problem in geometry. Compositio Math. 2(1935), 463-470.
232. Erdos, P., and Szekeres, G., On some extremum problems in elementary geometry. Annales Universitatis Scientiarum Budapestinensis de Rolando Eotvos Nominatae, Sectio Math. 3(1960/61), 53-62.
233. Erdos, P., and Turan, P., On Some Sequences of Integers, J. London Math. Soc. 11(1936), 261-264.
234. Erdos, P., and Wilson, R. J., On the chromatic index of almost all graphs. J. Combinatorial Theory Ser. B 23(1977), 255-257.
235. Erickson, Martin, An upper bound for the Folkman number F (3, 3;5). J. Graph Theory 17(6) (1993), 679-681.
236. Errera, A., Du Coloriage des Cartes et de Quelques Questions d'Analysis Situs, These pour le grade de Docteur Special en Sciences Physiques et Mathematiques. Gauthier-Villars & Co, Paris, 1921.
237. Exoo, G., Applying Optimization Algorithm to Ramsey Problems. In Y. Alavi (ed.), Graph Theory, Combinatorics, Algorithms, and Applications. SIAM Philadelphia, (1989) 175-179.
238. Exoo, G., A Lower Bound for R (5, 5), J. Graph Theory 13 (1989) 97-98.
239. Exoo, G., On Two Classical Ramsey Numbers of the Form R (3, n). SIAM J. Discrete Math 2(1989), 488-490.
240. Exoo, G., Announcement: On the Ramsey Numbers R (4, 6), R (5, 6) and R (3, 12). Ars Combinatorica 35 (1993) 85. The construction of a graph proving R (4, 6) ≥ 35 is presented in detail at http://ginger.indstate.edu/ge/RAMSEY (2001).
241. Exoo, G., Some Applications of pq-groups in Graph Theory, Discussiones Mathematicae Graph Theory 24 (2004) 109-114. Constructions available at http://ginger.indstate.edu/ge/RAMSEY
242. Exoo, G., Personal communication to S. P. Radziszowski (2005-2006). Constructions at http://ginger.indstate.edu/ge/RAMSEY
243. Falconer, K. J., The realization of distances in measurable subsets covering Rn. J. Combin. Theory (A), 31(1981), 187-189.
244. Falconer, K. J., 8-page manuscript written for this book, dated February 17, 2005.
245. Fischer, K. G., Additive κ-colorable extensions of the rational plane. Discrete Math. 82(1990), 181-195.
246. 2. Congressus Numerantium 72(1990), 213-221.
247. Flam, J., Matisse on Art. University of California Press, Berkeley, 1995.
248. Folland, G., Real Analysis: Modern Techniques and Their Applacations. 2nd ed, John Wiley & Sons, New York, 1999.
249. Folkman, J., Graphs with monochromatic complete subgraphs in every edge coloring, Rand Corporation Memorandum RM-53-58-PR, October 1967. Also appeared under the same title in SIAM J. Appl. Math. 18(1970), 19-24.
250. Fox, J., and Radoicic, R., The axiom of choice and the degree of regularity of equations over the reals, unpublished.
251. Fraenkel, A., Zu den Grundlagen der Cantor-Zermeloschen Mengenlehre. Math. Ann. 86(3-4) (1922), 230-237, (German).
252. Fraenkel, A., Axiomatische Begründung der transfiniten Kardinalzahlen. I., Math. Zeitschr. 13(1) (1922), 153-188, (German).
253. Fraenkel, A., Untersuchungen über die Grundlagen der Mengenlehre. Math. Zeitschr. 22(1) (1925), 250-273, (German).
254. Frankl, P., and Rodl, V, All triangles are Ramsey. Trans. Amer. Math. Soc. 297(1986), 777-779.
255. 4. Graphs Combin. 2(1986), no. 2, 135-144.
256. Frankl, P., and Rodl, V., A partition property of simplices in Euclidean space, J. Amer. Math. Soc, 3(1990), 1-7.
257. Frankl, P., and Wilson, R. M., Intersection theorems with geometric consequences. Combinatorica 1(1981), 357-368.
258. Frei, G., Dedication. Bartel Leendert van der Waerden, Zum 90. Geberstag. Historia Math. 20(1), (1993), 5-11.
259. Frei, G., Zum Gedenken an Bartel Leendert van der Waerden (2.2.1903-12.1.1996). Elem. Math. 53(1998), 133-138.
260. Frei, G., Top, J., and Walling, L., A short biography of B. L. van der Waerden, Nieuw Archief voor Wiskunde, Vierde serie 12(3) (1994), 137-144.
261. 2 statements (in preparation).
262. Furstenberg, H., Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions. J. D Analyse Math. 31(1977), 204-256.
263. Furstenberg, H., A polynomial Szemeredi theorem, manuscript dated January 1994.
264. Galperin, G., A letter to A. Soifer, undated, post-stamped March 1, 2005.
265. Garsia, A., Manuscript, Fall 1958, 10pp.
266. Gardner, M., The celebrated four-color map problem of topology. Scientific American 206(Sept. 1960), 218-226.
267. Gardner, M., A new collection of "brain teasers". Scientific American 206(Oct. 1960), 172-180.
268. Gardner, M., The coloring of unusual maps leads into Uncharted territory, Scientific American, 242, February 1980, 14-21.
269. Gismondi, S. J., and Swart, E. R., A new type of 4-colour reducibility, Congrs. Numer. 82(1991), 33-48.
270. Goffman, C, And What Is Your Erdos Number? Amer. Math. Monthly 76(7), (1969), 761.
271. Godel, K., Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme, I, Monatshefte für Mathematik und Physik 38(1931), 173-198.
272. Godel. K., The Consistency of the Axiom of Choice and of the Generalized Continuum Hypothesis with the Axioms of Set Theory. Princeton University Press, 1940.
273. Golomb, S. W, Letter to A. Soifer, September 10, 1001.
274. Golomb, S. W, Letter to A. Soifer, September 25, 1001.
275. Gonthier, G., A computer-checked proof of the Four Colour Theorem http://research.microsoft.com/∼gonthier/4colproof.pdf
276. Goodman, J. E., and O'Rourke, J. Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton, 1997.
277. Goudsmit, S. A., Alsos. Henry Schuman, New York, 1947.
278. Graham, R. L., On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon, J. Combin. Theory 4(1968), 300.
279. Graham, R. L., Rudiments of Ramsey Theory, American Mathematical Society, Providence, 1981; revised 1983.
280. Graham, R. L., Recent developments in Ramsey theory. Proceedings of the International Congress of Mathematicians, vol. 1, 2 (Warsaw, 1983), 1555-1567, PWN, Warsaw, 1984.
281. Graham, R. L., Recent Trends in Euclidean Ramsey Theory. Discrete Math. 136(1994), 119-127.
282. Graham, R. L., A problem talk for the about 200 finalists of the USA Mathematical Olympiad, Massachusetts Institute of Technology, May 4, 2002.
283. Graham, R. L., Talk at the Mathematical Sciences Research Institute, Berkeley, August 2003.
284. Graham, R. L., Open problems in euclidean Ramsey theory. Geombinatorics XIII (4) (2004), 165-177.
285. Graham, R. L., Some of my favorite problems in Ramsey Theory. In B. Landman et al. (eds.), Proceedings of the 'Integers Conference 2005' in Celebration of the 70th Birthday of Ronald Graham, Carrolton, Georgia, USA, October 27-30, 2005, Walter de Gruyter, Berlin, 2007, 229-236.
286. Graham, R. L., Old and new problems and results in Ramsey theory. Horizon of Combinatorics (Conference and EMS Summer School), Budapest and Lake Balaton, Hungary, 10-22 July 2006, to appear in 2008-2009.
287. Graham, R. L., and Nesetril, J., Ramsey Theory in the Work of Paul Erdõs. In Graham, R. L., and Nesetril (eds.) The Mathematics of Paul Erdõs II, Springer, Berlin, 1997, 193-209.
288. Graham, R. L., and Nesetril, J., Ramsey Theory and Paul Erdõs. In Halász, G., et al. (eds.), Paul Erdõs and his Mathematics II, Springer, Budapest, 2002, 339-365.
289. Graham, R. L.; Rothschild, B. L., Ramsey's theorem for n-parameter sets. Trans. Amer. Math. Soc. 159(1971), 257-292.
290. Graham, R. L., and Rothschild, B. L., A survey of finite Ramsey theorems, Proc. Second Louisiana Conf, on Combinatorics, Graph Theory and Computing, 1971, 21-40.
291. Graham, R. L.; Rothschild, B. L., Some recent developments in Ramsey theory. Combinatorics (Proc. Advanced Study Inst., Breukelen, 1974), Part 2: Graph theory; foundations, partitions and combinatorial geometry, 61-76. Math. Centre Tracts, No. 56, Math. Centrum, Amsterdam, 1974.
292. Graham, R. L., Rothschild, B. L., Spencer, J. H., Ramsey Theory, 1st edn., John Wiley & Sons, New York, 1980.
293. Graham, R. L., Rothschild, B. L., Spencer, J. H., Ramsey Theory. 2nd edn., John Wiley & Sons, New York, 1990.
294. Graham, R. L., and Spencer, J. H., On small graphs with forced monochromatic triangles. Recent trends in graph theory (Proc. Conf., New York, 1970), 137-141. Lecture Notes in Math., vol. 186. Springer, Berlin, 1971.
295. Graham, R. L., and Spencer, J. H., Ramsey Theory. Scientific American, July 1990, 112-117.
296. Graver, J. E., and Yackel, J., An upper bound for Ramsey numbers. Bull. Amer. Math. Soc. 72(1966), 1076-1079.
297. Graver, J. E., and Yackel, J., Some graph theoretic results associated with Ramsey's theorem. J. Combin. Theory 4(1968), 125-175.
298. Graves, R. P., Life of Sir William Rowan Hamilton, Knt., LL. D., D. C. L., M. R. I. A., Andrews Professor of Astronomy in the University of Dublin, and Royal Astronomer of Ireland, etc.: including selections from his poems, correspondence, and miscellaneous writings, vol. 1(1882), 2 (1885) and 3(1889), Hodges, Figgis, & Co., Dublin.
299. Green, B., and Tao, T., The primes contain arbitrarily long arithmetic progressions, 6th revision, 2007, arXiv:math/0404188v6.
300. Greenwood, R. E., and Gleason, A. M., Combinatorial relations and chromatic graphs. Can. J. Math., 7(1955), 1-7.
301. Grinstead, C., and Roberts, S., On the Ramsey Numbers R (3, 8) and R (3, 9). J. Combin. Theory Ser. B 33(1982), 27-51.
302. Groves, L. R., Now It Can be Told. Harper, New York, 1962.
303. Grötzsch, H., Ein Dreifarbensatz ftir dreikreisfreie Netze auf der Kugel, Wissenschaftliche Zeitschrift der Martin-Luther-Universitat Halle-Wittenberg. Mathematisch-Naturwissenschaftliche Reihe, 8(1958-1959), 109-120.
304. Grünbaum, B., Grötzsch's theorem on 3-colorings. Michigan Math. J. 10(1963), 303-310.
305. The Late Professor Guthrie, Cape Times, October 23, 1899, Cape Town, South Africa.
306. A biography of Francis Guthrie in Dictionary of South African Biography. vol. II, Tafelberg-Uitgewers LTD., Editor-in-chief D. W. Krüger, 279-280.
307. Ritchie, W., The History of the South African College 1829-1918, T. Maskew Miller, Capetown, 1918.
308. Guthrie, Frederick, Note on the Colouring of Maps. Proceedings of the Royal Society of Edinburgh 10(1880), 727-728.
309. Guy, Richard K., Unsolved Problems in Number Theory, 2nd edn., Springer-Verlag, New York, 1994.
310. Hadwiger, H., Über eine Klassification der Steckenkomplexe. Vierteljschr. Naturforsch. Ges. Zürich 88(1943), 133-142.
311. Hadwiger, H., Ein Überdeckungssätz für den Euklidischen Raum. Portugal Math., 4(1944), 140-144.
312. Hadwiger, H., Uberdeckung des euklidischen Raum durch kongruente Mengen. Portugaliae Math., 4(1945), 238-242.
313. Hadwiger, H., Ungelöste Probleme, Nr. 11. Elemente der Mathematik 16(1961), 103-104.
314. Hadwiger, H., and Debrunner, H., Ausgewählte einzelprobleme der kombinatorishen geometrie in der ebene. L'Enseignement Mathematique 1(1955), 56-89.
315. Hadwiger, H., and Debrunner, H., Kombinatorischen Geometrie in der Ebene. L'Enseignement Mathematique, Geneva, 1959.
316. Hadwiger, H., and Debrunner, H., Combinatorial Geometry of the Plane edited by I. M. Yaglom, Nauka, Moscow, 1965 (extended by the editor Russian Translation version of [HD2]).
317. Hadwiger, H., Debrunner, H., and Klee, V., Combinatorial Geometry in the Plane. Holt, Rinehart and Winston, New York, 1964.
318. Hadziivanov, N. G., and Nenov, N. D., On the Graham-Spencer number (Russian). C R Acad Bulg. Sci. 32(1979), 155-158.
319. Hadziivanov, N. G., and Nenov, N. D., Every (3, 3)-Ramsey graph without 5-cliques has more than 11 vertices (Russian). Serdica 11(1985), 341-356.
320. Hales, A., and Jewett, R., Regularity and positional games, Trans. Amer. Math. Soc. 106(1963), 222-229.
321. Halmos, P. R., Has Progress in Mathematics Slowed Down? Amer. Math. Monthly 98(1990), 561-578.
322. Hamilton, W. R., Letter to A. De Morgan dated October 26, 1852; TCD MS 1493, 669; Trinity College Dublin Library, Manuscripts Department.
323. Harary, F., Graph Theory. Addison Wesley, Reading, Massachusetts, 1969.
324. Harary, F., The Four Color Conjecture and other graphical diseases. In F. Harary (ed.), Proof Techniques in Graph Theory, Academic Press, New York, 1969, 1-9.
325. Harary, F., A Tribute to Frank P. Ramsey, 1903-1930, J. Graph Theory 7(1983), 1-7.
326. Harary, F., Letter to A. Soifer, dated February 19, 1996.
327. Harborth, H., Konvexe Fünfecke in ebenen Punktmengen. Elem. Math. 33(1978), 116-118.
328. Harborth, H., and Krause, S., Ramsey Numbers for Circulant Colorings. Congressus Numerantium 161(2003), 139-150.
329. Hatfield, L., and Ringel, G., Pearls in Graph Theory: A Comprehensive Introduction, Academic Press, Boston, 1994
330. Havel, I., On a conjecture of B. Grünbaum, J. Combin. Theory 7(1969), 184-186.
331. Heawood, P. J., Map-Colour Theorem. Quarterly J. of Pure and Applied Math. XXIV (1890), 332-338.
332. Heawood, P. J., On the Four-Colour Map Theorem. Quarterly J. of Pure and Applied Math. XXIX (1998), 270-285.
333. Headmaster of Clifton College, [Untitled], J. Educ. IX, January 1, 1887, 11-12.
334. Headmaster of Clifton College, [Untitled], J. Educ. XI, June 1, 1889, 277.
335. Heesch, H., Untersuchungen zum Vierfarbenproblem (German), B. I. Hochschulscripten, 810/810a/810b, Bibliographisches Institut, Mannheim-Vienna-Zürich, 1969.
336. 7. J. Combin. Theory Ser. B 13(1972), 46-55.
337. Editorial, Die Neen, die niet! Het Parool No. 312, January 16, 1946, 3.
338. Editorial, Prof. Van der Waerden nog niet Benoemd, Het Parool No. 313, January 17, 1946, 1.
339. Editorial, Prof. dr. B. L. Van Der Waerden, Het Parool No. 320, January 25, 1946, 1.
340. Red. (eds.), Untitled commentary on Van der Waerden's letter. Het Parool No. 326, February 1, 1946, 3.
341. Editorial, Rondom Van Der Waerden, Het Parool No. 336, February 13, 1946, 3.
342. Hilbert, D., Ueber die Irreducibilität ganzer rationaler Functionen mit ganzzahligen Coefficienten, J. Reine Angew. Math. 110(1892), 104-129.
343. Hill, R., and Irving, R. W., On group partitions associated with lower bounds for symmetric Ramsey numbers. European J. Combin. 3(1) (1982), 35-50.
344. Hilton, A. J. W., and Hind, H. R. The total chromatic number of graphs having large maximum degree. Discrete Math. 17(1993), no. 1-3, 127-140.
345. Hind, H. R. An upper bound for the total chromatic number. Graphs Combin. 6(1990), no. 2, 153-159.
346. Hind, H. R., An upper bound for the total chromatic number of dense graphs. J. Graph Theory 16(1992), no. 3, 197-203.
347. Hind, H., Molloy, M., and Reed, B., Total coloring with Δ + poly (log Δ) colors, SIAM J. Comput. 28(3) (1999), 816-821.
348. Hindman, N., Finite sums from sequences within cells of a partition of N, J. Combin. Theory Ser. A 17(1974), 1-11.
349. Hobbs, A. M., and Oxley, J. G., William T. Tutte, 1917-2002, Notices Amer. Math. Soc. 51(2004), 320-330.
350. Hochberg, R., and O'Donnell, P., Some 4-Chromatic unit-distance graphs without small cycles. Geombinatorics V (4) (1996), 137-14.
351. Hodge, Sir W., Solomon Lefschetz 1884-1972. Biographical Memoirs of Fellows of the Royal Society 19(December 1973), 433-453.
352. Hofer, H., Letter to A. Soifer of March 3, 1995.
353. Hoffman, I., and Soifer, A., Almost chromatic number of the plane. Geombinatorics III (2), 1993, 38-40.
354. Hoffman, I., and Soifer, A., Another six-coloring of the plane. Discrete Mathematics 150(1996), 427-429.
355. Holt, J., Irreligion, a review of the book by Paulos, J. A., A Mathematician Explains Why the Arguments for God Just Don't Add Up; The New York Times Book Review, January 13, 2008, 18.
356. Horgan, J., The death of proof. Scientific American, October 1993, 92-103.
357. Horton, J. D., Sets with no Empty Convex 7-Gons. Canad. Math. Bull. 26(4) (1983), 482-484.
358. Huang Y. R., and Zhang K. M., An new upper bound formula for two color classical Ramsey numbers. J. Combin. Math. and Combin. Computing 28(1998), 347-350.
359. Isbell, J., Letter to A. Soifer of August 26, 1991.
360. Isbell, J., Letter to A. Soifer of September 3, 1991.
361. Irving, R. W., On a bound of Graham and Spencer for a graph-coloring constant. J. Combin. Theory Ser. B 15(1973), 200-203.
362. Irving, R. W., Generalised Ramsey numbers for small graphs, Discr. Math. 9(1974), 251-264.
363. Jech, T. J., The Axiom of Choice. North-Holland, Amsterdam, 1973.
364. Jeffrey, R. C., The Logic of Decision. McGraw-Hill, New York, 1965.
365. Jeffreys, B., Letter to the Editor. Math. Gazette 63(1979), 126-127.
366. Jelínek, V., Kyncl, J., Stolar, R., and Valla, T. V., Monochromatic triangles in two-colored plane, Combinatorica (submitted March 2006); arXiv:math. CO/0701940v1, Jan. 31, 2007.
367. Jensen, T. R., and Toft, B., Graph Coloring Problems. Wiley, New York, 1995.
368. Jessop, J., Some Botanists and Botanical Collectors associated with Southern Africa, in Lantern, 1963, 80-85.
369. Johnson Jr., P. D., Coloring abelian groups. Discrete Math. 40(1982), 219-223.
370. Johnson Jr., P. D., Simple product colorings. Discrete Math. 48(1984), 83-85.
371. 2 that forbid many distances. Congressus Numerantium 60(1987), 51-58.
372. n that forbid many distances. Discrete Math. 79(1989/90), 191-195.
373. Johnson Jr., P. D., Product colorings. Geombinatorics I(3) (1991), 11-12.
374. Johnson Jr., P. D., Maximal sets of translations forbiddable by two-colorings of abelian groups. Congressus Numerantium 91(1992), 153-158.
375. Johnson Jr., P. D., About Two definitions of the fractional chromatic number. Geombinatorics V (3) (1996), 11-12.
376. Johnson Jr., P. D., Introduction to "Colorings of metric spaces" by Benda and Perles. Geombinatorics IX (3) (2000), 110-112.
377. Johnson Jr., P. D., Coloring the rational points to forbid the distance one-a tentative history and compendium. Geombinatorics XVI (1) (2006), 209-218.
378. Juhász, R., Ramsey type theorems in the plane. J. Combin. Theory (A) 27(1979), 152-160.
379. 2. Discrete Math. 82(1990), 53-56.
380. Kahn, J., and Kalai, G., A counterxample to Borsuk's conjecture, Bull. Amer. Math. Soc. 29(1) (1993), 60-62.
381. Kainen, P., Is the four color theorem true? Geombinatorics III (2) (1993), 41-56.
382. Kalbfleisch, J. G., Construction of special edge-chromatic graphs. Canad. Math. Bull. 8(1965), 575-584.
383. Kalbfleisch, J. G., Chromatic Graphs and Ramsey's Theorem, Ph. D. thesis, University of Waterloo, Canada, January 1966.
384. Kalbfleisch, J. G., On an unknown Ramsey number. Michigan Math. J. 13(1966), 385-392.
385. Kakeya, S., and Morimoto, S., On a theorem of M. Bandet [sic] and van der Waerden. Japan. J. Math. 7(1930), 163-165.
386. Karabash, D., and Soifer, A., On Shelah-Soifer Class of Graphs, Geombinatorics XVI (4) (2007), 363-366.
387. Keizer, Madelon De, Het Parool 1940-1945: Verzetsblad in Oorlogstijd, 2nd edn., Otto Cramwinckel Uitgever, Amsterdam, 1991.
388. Kelly, J. B., and Kelly, L. M., Paths and circuits in critical graphs. Amer. J. Math. 76(1954), 786-792.
389. Kempe, A. B., How to colour a map with four colours. Nature 20(July 17, 1879), 275.
390. Kempe, A. B., On the geographical problem of the four colours, Amer. J. Math. II (1879), 193-200.
391. Kempe, A. B., [Untitled]. Proc. London Math. Soc. 10(1878-1879), 229-231.
392. Kempe, A. B., How to colour a map with four colours. Nature 21(February 26, 1880), 399-400.
393. Kempe, A. B., Untitled Abstract. Proc. London Math. Soc. 22(1890-1891), 263-264.
394. Kersten, I., Biography of Ernst Witt (1911-1991), Contemporary Mathematics 272(2000), 155-171.
395. Kéry, G., On a Theorem of Ramsey. Matematikai Lapok 15 (1964) 204-224 (Hungarian).
396. Ketonen, J., and Solovay, R., Rapidly growing Ramsey functions. Annals of Math. 113(1981), 267-314.
397. Keynes, J. M., Essays in Biography. W. W. Norton & Co., New York, 1963.
398. 2. Combin. Probab. Comput. 15 (1-2) 2006, 213-227.
399. Khinchin, A. Y., Tri Zhemchuzhiny Teorii Chisel. Gos. Izd-vo tekhn.-teoret, lit-ry, Moskva, 1947.
400. Khinchin, A. Y., Tri Zhemchuzhiny Teorii Chisel. Gos. Izd-vo tekhn.-teoret, lit-ry, 2nd edn., Moskva, 1948.
401. Chintschin, A. J., Drei Pearlen der Zahlentheorie. Akademie Verlag, Berlin, 1951.
402. Khinchin, A. Y., Three Pearls of Number Theory. Graylock, Rochester, New York, 1952.
403. Kipling, R., Just So Stories. 1st edn., Macmillan Publishers Ltd., London, 1902.
404. Klee, V., and Wagon, S., Old and new Unsolved Problems in Plane Geometry and Number Theory. Mathematical Association of America, 2nd edn., (with Addendum), 1991.
405. Kleinberg, E. M., The independence of Ramsey's theory. J. Symbolic Logic 34(1969), 205-206.
406. Kleitman, D. J., and Pachter, L., Finding convex sets among points in the plane. Discrete and Computational Geometry 19(1998), 405-410.
407. Knegtmans, P. J., Socialisme en Democratie: De SDAP tussen klasse en natie (1929-1939). Cip-Gegevens Koninklijke Bibliotheek, Den Haag, 1989.
408. Knegtmans, P. J., Een Kweetsbaar Centrum van de Geest: De Universiteit van Amsterdam tussen 1935 en 1950. Amsterdam University Press, 1998.
409. Křiž, I., Permutation groups in Euclidean Ramsey Theory. Proc. Amer. Math. Soc. 385(1991), 899-908.
410. Křiž, I., All trapezoids are Ramsey, Discrete Math. 108(1992), 59-62.
411. Kuhn, H. W., and Tucker, A. W., John von Neumann's work in the theory of games and mathematical economics. Bull. Amer. Math. Soc. 64(1958), 100-122.
412. Kundera, M., The Curtain: An Essay in Seven Parts. 1st edn., HarperCollins, New York, 2006.
413. Landman, B. M., and Robertson, A., Ramsey Theory on the Integers. American Mathematical Society, Providence, 2004.
414. Lang, S., Algebra. Addison-Wesley, Reading, Massachisetts, 1965.
415. Larman, D. G., A note on the realization of distances within sets in euclidean space. Commentarii Math. Helvetici 53(1978), 529-535.
416. Larman, D. G., and Rogers, C. A., The realization of distances within sets in Euclidean space. Mathematika 19(1972), 1-24.
417. Ledermann, W., Issai Schur and his school in Berlin. Bull. London Math. Soc. 15(1983), 97-106.
418. Ledermann, W., Ledermann's St Andrews Interview, conducted by O'Connor, J. J., and Robertson, E. F., September, 2000, http://www-gap. dcs.stand.ac.uk/∼ history/HistTopics/Ledermann interview.html 69
419. Ledermann, W., and Neumann, P., The Life of Issai Schur through Letters and other Documents. In Joseph et al. (eds.) In Memory of Issai Schur, Birkhäuser, Boston, 2003, xiv-xci.
420. Lehto, O., On the life and work of Lars Ahlfors. Mathematical Intelligencer 20(4) (1999), 4-8.
421. r-coloring of graphs. J. Combin. Theory Ser. B 12(1972), 82-92.
422. Litten, F., Die Carathéodory-Nachfolge in München 1938-1944. Centaurus 37(1994), 154-172.
423. Lovász, L., On chromatic number of finite set-systems. Acta Math. 19(1968), 59-67.
424. Lovász, L., Combinatorial Problems and Exercises. North Holland, Amsterdam, 1979.
425. Lovász, L., Saks, M., and Schrijver, A., Orthogonal representations and connectivity of graphs. Linear Algebra Appl. 114/115(1989), 439-454.
426. Lovász, L., and Vesztergombi, K., Geometric Representations of Graphs. In Halás, G. et al. (eds.), Paul Erdõs and his Mathematics II, Springer, 2002, 471-498.
427. Lewin, S. R., Lise Meitner: A Life in Physics, Univ. California Press, Berkeley, 1997.
428. Lu, X., and Xu, B., A theorem on 3-colorable plane graphs, J. Nanjing Norm. Univ. Nat. Sci. 29(2006), 5-8.
429. Luo, X., Chen, M., and Wang, W., On 3-colorable planar graphs without cycles of four lengths. Information Processing Letters, to appear in 2007.
430. Lovász, L., Three short proofs in graph theory. J. Combin. Theory, Ser. B 19(1975), 269-271.
431. Mackey, J., Combinatorial Remedies, Ph. D. Thesis, Department of Mathematics, University of Hawaii, Hawai'i 1994.
432. Mann, M., A new bound for the chromatic number of the rational five-space. Geombinatorics XI (2) (2001), 49-53.
433. Mann, M., Hunting unit-distance graphs in rational n-spaces. Geombinatorics XIII (2) (2003), 86-97.
434. May, K., The origin of the four-color conjecture. ISIS 56(3), Fall 1965, 346-348.
435. McKay, B. D., and Radziszowski, S. P., R (4, 5) = 25. J. Graph Theory 19(1995), 309-322.
436. McKay, B. D., and Radziszowski, S. P., Subgraph Counting Identities and Ramsey Numbers. J. Combin Theory Ser. B 69(1997), 193-209.
437. McKay, B. D., and Zhang, K. M., The value of the Ramsey number R (3, 8). J. Graph Theory 16(1992), 99-105.
438. Mehrtens, H., Irresponsible purity: the political and moral structure of mathematical sciences in the National Socialist state. In M. Renneberg and M. Walker, (eds.), Science, Technology and National Socialism, Cambridge University Press, 1994, 324-338 and 411-413.
439. Mellor, D. H., Cambridge Philosophers I: F. P. Ramsey. Philosophy 70(1995), 243-262.
440. Milosz, C., The Captive Mind. Octagon, New York, 1981.
441. Minnaert, M. G. J., Lilght and Color in the Outdoors. Springer-Verlag, New York, 1993.
442. Mirsky, L., The combinatorics of arbitrary partitions. Bull. Inst. Math. 11(1975), 6-9.
443. Moore, G. H., Zermelo's Axiom of Choice: Its Origins, Development, and Influence. Springer-Verlag, New York, 1982.
444. Mordell, L. J., On the rational solutions of the indeterminate equations of the thurd and fourth degrees. Proc. Cambridge Philos. Soc. 21(1922), 179-182.
445. Morrison, P., Alsos: The Story of German Science. Bull. Atomic Sci. 3(12) (1947), 354, 365.
446. Moser, L., and Moser, W., Solution to Problem 10. Can. Math. Bull. 4(1961), 187-189.
447. Moser, W., and Pach, J., Research Problems in Discrete Geometry. McGill University, 1986.
448. Mycielski, J., Sur le coloriage des graphes. Colloquium Mathematicum 3(1955), 161-162.
449. Nechushtan, O., On the space chromatic number. Discrete Math. 256(2002), 499-507.
450. Nelson, E., Letter to A. Soifer of August 23, 1991.
451. Nelson, E., Letter to A. Soifer of October 5, 1991.
452. Nelson, R., and Wilson, R. J.. (eds.), Graph Colourings. Longman Scientific and Technical, Essex, England, 1990.
453. Nenov, N. D., A new lower bound for the Graham-Spencer number (Russian). Serdica 6(1980), 373-383.
454. Nenov, N. D., An example of a 15-vertex (3, 3)-Ramsey graph with clique number 4(Russian). C R Acad Bulg Sci 34(1981), 1487-1489.
455. Nešetřil, J., and Rödl, V., The Ramsey property for graphs with forbidden complete subgraphs. J. Combin. Theory Ser. B 20(1976), 243-249.
456. Neumann, J. Von, Über die Definition durch transfinite Induktion und verwandte Fragen der allgemeinen Mengenlehre. Math. Annalen 99(1928), 373-391.
457. Nilli, A., On Borsuk's problem. Contemporary Math. 178(1994), 209-210.
458. Neumann, J. Von, and Morgenstern, O., Theory of Games and Economic Behavior. Princeton University Press, Princeton, 1944.
459. O'Donnell, P., A Triangle-Free 4-Chromatic Graph in the Plane. Geombinatorics IV (1) (1994), 23-29.
460. O'Donnell, P., A 40 Vertex 4-Chromatic Triangle-free Unit-Distance graph in the plane. Geombinatorics V (1) (1995), 30-34.
461. O'Donnell, P., High Girth Unit-Distance Graphs, Ph. D. Dissertation, Rutgers University, May 25, 1999.
462. O'Donnell, P., Arbitrary Girth, 4-ChromatiUnit-Distance graphs in the plane part I: Graph Description. Geombinatorics IX (3) (2000), 145-150.
463. O'Donnell, P., Arbitrary Girth, 4-Chromatic Unit-Distance graphs in the plane part II: Graph Embedding. Geombinatorics IX (4) (2000), 180-193.
464. O'Rourke, J., Omputational Geometry Column 46. International J. Comput. Geom. & Applic. 14(6) (2004), 475-478.
465. Ó Seanór, S., Letter to A. Soifer from March 21, 1997.
466. Oxford English Dictionary, June 2007 edition, http://dictionary.oed.com
467. Paris, J., and Harrington, L., Mathematical Incompleteness in Peano Arithmetic. In Barwise, J. (ed.), Handbook of mathematical Logic, North-Holland, Amsterdam, 1977, 1133-1142.
468. Pash, B. T., The Alsos Mission. Award House, New York, 1969.
469. Payne, M. S., A unit distance graph with ambiguous chromatic number, arXiv: 0707.1177v1[math. CO] 9 Jul. 2007.
470. Peremans, W., Van der Waerden Day in Groningen. Nieuw Archief voor Wiskunde, Vierde serie 12(3) (1994), 135-136.
471. Peter, L. J., Peter's Quotations: Ideas for Our Time. William Morrow, New York, 1977.
472. Peters, P., Mijnheer De Red. Propria Cures, 56th year, No. 22, February 8, 1946.
473. Picasso, P., and Ashton, D. (ed.), Picasso on Art: A Selection of Views. Da Capo, New York, 1992.
474. Piwakowski, K., Radziszowski, S. P., and Urbánski, S., Computation of the Folkman number Fe (3, 3; 5). J. Graph Theory 32(1999), 41-49.
475. Poincaré, H., The Foundations of Science. The Science Press, Lancaster, PA, 1946.
476. Materialy Konferenzii "Poisk-97", Moscow, 1997, (Russian).
477. Pólya, G., and Alexanderson, G. L., The Pólya Picture Album: Encounters of a Mathematician. Birkha¡¿user, Boston, 1987.
478. Pontryagin L. S., wrote Life of Lev Semenovich Pontryagin, mathematician, compiled by himself. Born 1908, Moscow, Moscow, 1998.
479. Powers, T., Heisenberg's War: The Secret History of the German Bomb. Little, Brown and Co., Boston, 1993.
480. Prévert, Jacques, Paroles, Le Calligraphe, Paris, 1945 [copyright Éditions du Point du Jour, 1946], (French).
481. Pritikin, D., All Unit-Distance Graphs of Order 6197 Are 6-Colorable. J. Combin. Theory, Ser. B 73(2) (1998), 159-163.
482. Prömel, H. J., and Rödl, V., An elementary proof of the canonizing version of Gallai-Witt's Theorem. J. Combin. Theory Ser. A 42(1983), 144-149.
483. Prömel, H. J., and Voigt, B., Aspects of Ramsey-Theory, parts I, II, III, and V, Universität Bonn, unpublished report with part IV missing, 1989.
484. Rado, R., Studien zur Kombinatorik. Math. Zeitschrift 36(1933), 424-480.
485. Rado, R., Note on Combinatorial Analysis, Proc. London Math. Soc. 48(2) (1943), 122-160.
486. Radoicic, R., and Tóth, G., Note on the chromatic number of the space. In B. Aronov, S. Basu, J. Pach, and M. Sharir (eds.), Discrete and Computational Geometry: the Goodman-Pollack Festschrift, 695-698, Springer-Verlag, Berlin, 2003.
487. Radziszowski, S. P., Small Ramsey Numbers, revision 1, August 1, 2006, Electronic Journal of Combinatorics, Dynamic Surveys DS1 http://www.cs.rit. edu/∼spr/ElJC/abs.pdf
488. Radziszowski, S. P., and Xu, X., On the most wanted Folkman graph. Geombinatorics XVI (4) (2007), 367-381.
489. Radziszowski, S. P., and Kreher, D. L., Upper bounds for some Ramsey numbers R (3, k), J. Combin. Math. and Combin. Computing 4(1988), 207-212.
490. Raigorodskii, A. M., On a bound in Borsuk's problem, Russ. Math. Surv. 54(2), (1999), 453-454.
491. Raigorodskii, A. M., On the chromatic number of a space. Russ. Math. Surv. 55(2) (2000), 351-352.
492. Raigorodskii, A. M., Borsuk's problem and the chromatic numbers of some metric spaces. Russ. Math. Surv. 56(1) (2001), 103-139.
493. Raigorodskii, A. M., The Borsuk and Hadwiger problems and systems of vectors with restrictions on scalar products. Russ. Math. Surv. 57(3) (2002), 606-607.
494. Raigorodskii, A. M., The Borsuk problem for integral polytopes, Sb. Math. 193(10) (2002), 1535-1556.
495. Raigorodskii, A. M., Chromatic Numbers (Russian). Moscow Center of Continuous Mathematical Education, Moscow, 2003.
496. Raiskii, D. E., Realizing of all distances in a decomposition of the space Rn into n + 1 Parts. Mat. Zametki 7(1970), 319-323 [Russian];
497. Engl. transl., Math. Notes 7(1970), 194-196.
498. Ramsey, F. P., Mathematical Logic. Mathematical Gazette 1926.
499. Ramsey, F. P., On a problem of formal logic. Proc. London Math. Soc. Ser 2, vol. 30, part 4, 1930, 338-384.
500. Ramsey, F. P., and Braithwaite, R. B. (ed. and Introduction), Moore, G. E. (Preface), The Foundations of Mathematics. Kegan Paul, Trench, Trubner & Co., London, 1931.
501. Ramsey, F. P., Truth and Probability, 1926, in Ramsey. In F. P., Mellor, D. H. (ed.), Philosophical Papers, Cambridge University Press, Cambridge, 1990.
502. Ramsey, F. P., and Galavotti, M. C., (ed.), Notes on Philosophy and Mathematics. Bibliopolis, Napoli, 1991.
503. Read, H., Gabo, Naum Gabo: March 2-April 1968. Albright-Knox Art Gallery, Buffalo, New York, 1968, 5.
504. Reid, C., Hilbert. London, Allen & Unwin, Springer-Verlag, Berlin, 1970.
505. Reid, M. A., Undergraduate algebraic geometry. Cambridge University Press, Cambridge, 1988.
506. Ritchie, W., The History of the South African College. T. Maskew Miller, Capetown, 1, 1918.
507. Robertson, N., E-mail to A. Soifer, May 9, 1994.
508. Robertson, N., Sanders, D. P., Seymour, P. D., and Thomas, R., The four-colour theorem. J. Combin. Theory Ser. B 70(1) (1997), 2-44.
509. 6-free graphs. Combinatorica 13(3) (1993), 279-361.
510. Rota, G.-C., Indiscrete Thoughts. Birkhäuser, Boston, 1997.
511. Roth, K. F., On certain sets of integers. J. London Math. Soc. 28(1953), 104-109.
512. Saaty, T. L., Remarks on the Four Color Problem; The Kempe Catastrophe. Math. Magazine 40(1) (1967), 31-36.
513. Saaty, T. L., Thirteen colorful variations on Guthrie's Four-Color Conjecture. Amer. Math. Monthly 79(1) (1972), 2-43.
514. Saaty, T. L., and Kainen, P. C., The Four-Color Problem: Assaults and Conquest, McGraw-Hill, New York, 1977.
515. Sanders, J. H., A Generalization of Schur's Theorem, Ph. D. Dissertation, Yale University, New Haven, 1968.
516. Sanders, D. P., and Zhao, Y., A note on the three color problem. Graphs and Combinatorics 11(1995), 91-94.
517. Savage, L. J., The Foundation of Statistics. John Wiley & Sons, New York, 1954.
518. Schiffer, M. M., Issai Schur: Some Personal Reminiscences. In H. Begehr, (ed.), Mathemaik in Berlin: Geschichte und Documentation, vol. 2, 1998, 177-181.
519. Segal, S. L., Mathematicians under the Nazis. Princeton University Press, Princeton, 2003.
520. Siegmund-Schultze, R., Mathematiker auf der Flught vor Hitler, Deutche Mathematiker-Vereinigung, 1998.
521. Schoenbaum, D., Hitler's Social Revolution: Class and Status in Nazi Germany 1933-1939, W. W. Norton, New York, 1980.
522. Schoenberg, A., Preface in Anton Webern, 6 Bagatellen für Streichquartett, op. 9, Partitur, Universal Edition.
523. Schuh, F., In memoriam (Pierre Joseph Henry Baudet). Christian Huygens I (1921-1922), 145.
524. m (mod. p). Jahresbericht der Deutschen Mathematiker-Vereinigung 25(1916), 114-117.
525. Segal, S., Mathematicians under the Nazis. Princeton University Press, 2003.
526. Seidenberg, A., A simple proof of Erdõs and Szekeres, J. London Math. Soc., 34(1959), 352.
527. 2 ! J. Combin. Theory Ser. A 20(1976), 385-389.
528. Shelah, S., Primitive recursive bounds for van der Waerden numbers. J. Amer. Math. Soc. 1(1988), 683-697.
529. Shelah, S., Cardinal Arithmrtic. Clarendon Press, Oxford, 1993.
530. Shelah, S., Logical Dreams. Bull. Amer. Math Soc. 40(2003), 203-228.
531. Shelah, S., and Soifer, A., Axiom of choice and chromatic number of the plane. J. Combin. Theory Ser. A 103(2003), 387-391.
532. Shelah, S., and Soifer, A., Chromatic number of the plane & its relatives part III: Its Future. Geombinatorics XIII (1) (2003), 41-46.
533. Siegmund-Schultze, R., Rockefeller and the Internationalization of Mathematics Between the Two World Wars. Birkhäuser, Basel, 2001.
534. Simmons, G. J., The chromatic number of the sphere. J. Austral. Math. Soc. Ser. A 21(1976), 473-480.
535. Skolem, T., Ein Kombinatorische Satz mit Anwendung auf ein Logisches Entscheidungsproblem. Fundamenta Math. 20(1933), 254-261.
536. Soare, R. I., Recursively Enumerable Sets and Degrees. Springer-Verlag, 1987.
537. Soifer, A., and Shelah, S., Axiom of Choice and Chromatic Number: An Example on the Plane. J. Combin. Theory Ser. A 105(2) (2004), 359-364.
538. Soifer, A., Mathematics as Problem Solving. Center for Excellence in Mathematical Education, Colorado Springs, 1987. (A new edition should appear in Springer in 2009.)
539. Soifer, A., How Does One Cut a Triangle? Center for Excellence in Mathematical Education, Colorado Springs, 1990. (A new edition should appear in Springer in 2009.)
540. Soifer, A., Triangles in a two-colored plane. Geombinatorics I (1) (1991), 6-7
541. Soifer, A., Triangles in a three-colored plane. Geombinatorics I (2) (1991), 11-12 and I (4) (1992), 21.
542. Soifer, A., Chromatic number of the plane: A historical essay. Geombinatorics I (3), 1991, 13-15.
543. Soifer, A., Relatives of chromatic number of the plane I. Geombinatorics I(4) (1992), 13-15.
544. Soifer, A., A six-coloring of the plane. J. Combin. Theory, Ser A, 61(2) (1992), 292-294.
545. 6. Geombinatorics III (4), (1994), 140-145.
546. Soifer, A., An infinite class of 6-colorings of the plane. Congressus Numerantium 101(1994), 83-86.
547. Soifer, A., Colorado Mathematical Olympiad: The First Ten Years and Further Explorations. Center for Excellence in Mathematical Education, Colorado Springs, 1994. (A new edition, covering the first 20 years, and including 20 explorations, should appear in Springer in 2009).
548. Soifer, A., Issai Schur: Ramsey Theory before Ramsey. Geombinatorics V (1) (1995), 6-23.
549. Soifer, A., Pierre Joseph Henry Baudet: Ramsey Theory before Ramsey. Geombinatorics VI (2) (1996), 60-70.
550. Soifer, A., The Baudet-Schur conjecture on monochromatic arithmetic progressions: An Historical Investigation. Congressus Numerantium 117(1996), 207-216.
551. Soifer, A., On the border of two years: An interview with Paul Erdõs. Geombinatorics VI (3) (1997), 99-110.
552. Soifer, A., "And you don't even have to believe in G'd, but you have to believe that the book exists", Geombinatorics VI (3) (1997), 111-116.
553. Soifer, A., Map coloring in victorian age: Problems, history, results, Mathematics Competitions 10(1) (1997), 20-31.
554. Soifer, A., Competitions, Mathematics, Life. Mathematics Competitions 11(2) (1998), 20-41.
555. Soifer, A., 50th Anniversary of one problem: Chromatic Number of the Plane. Mathematics Competitions 16(1) (2003), 9-41.
556. Soifer, A., Chromatic number of the plane & Its relatives part I: The problem & its history. Geombinatorics XII(3) (2003), 131-148.
557. Soifer, A., Chromatic number of the plane & its relatives part II: Polychromatic Number and 6-coloring. Geombinatorics XII (4) (2003), 191-216.
558. Soifer, A., In Search of Van der Waerden. Leipzig and Amsterdam, 1931-1951. Part I: Leipzig. Geombinatorics XIV (1) (2004), 21-40.
559. Soifer, A., In Search of Van der Waerden. Leipzig and Amsterdam, 1931-1951. Part II: Amsterdam, 1945. Geombinatorics XIV (2) (2004), 72-102.
560. Soifer, A., A Journey from Ramsey theory to mathematical Olympiad to finite projective planes. Mathematics Competitions 17(2) (2004), 8-16.
561. n. Journal of Combinatorial Theory, Series A, 110(1) (2005), 169-173.
562. Soifer, A., In Search of Van der Waerden. Leipzig and Amsterdam, 1931-1951. Part III: Amsterdam, 1946-1951. Geombinatorics XIV (3) (2005), 124-161.
563. Soifer, A., On Stephen P. Townshend's 1976 Proof. Geombinatorics XVI (4) (2005), 181-183.
564. Soifer, A., In Search of Van der Waerden: The Early Years. Geombinatorics XIV (3) (2007), 305-342.
565. Soifer, A., Chromatic number of the plane theorem in Solovay's set theory. Geombinatorcs XVII (2) (2007), 85-87.
566. Soifer, A., Editorial dedicated to Paul Erdõs's 80th Birthday. Geombinatorcs II (3) (1993), 43-45.
567. Soifer, A., To Leave, To Die, or To Compromise? A Review of Constantin Carathéodory: Mathematics and Politics in Turbulent Times, by Georgiadou, M., Geombinatorics XIV (1) (2004), 41-46.
568. Soifer, A., and Lozansky, E., Pigeons in every Pigeonhole. Quantum, January 1990, 24-28 and 32.
569. Solovay, R. M., A model of set theory in which every set of reals is Lebesgue measurable. Ann. Math. 92 Ser. 2(1970), 1-56.
570. Solovay, R., M., e-mail to A. Soifer, April 11, 2003.
571. Solovay, R., e-mail to A. Soifer, June 12, 2006.
572. Spencer, J. H., Introductory Commentary, in Paul Erdös, The Art of Counting, MIT Press, Cambridge, Massachusetts, 1973, xxiii.
573. Spencer, J. H., Ramsey theory and Ramsey theoreticians, J. Graph Theory 7(1983), 15-23.
574. Spencer, J. H., Three hundred million points suffice, J. Combin. Theory Ser. A 49(1988), 210-217.
575. Spencer, J. H., Erratum: "Three hundred million points suffice". J. Combin. Theory Ser. A 50(1989), no. 2, 323.
576. Spencer, T., University of Nebraska at Omaha, personal communication with S. P. Radziszowski (1993), and, Upper Bounds for Ramsey Numbers via Linear Programming, manuscript, (1994).
577. Steinberg, R., The state of the three color problem. In J. Gimbel, J. W. Kennedy, and L. V. Quintas, (eds.), Quo Vadis, Graph Theory? Annals of Discrete Math. 55(1993), 211-248.
578. Steinhaus, H., Sur les distances des points des ensembles de mesure positive. Fund. Math. 1(1920), 93-104.
579. Steen, L. A., Solution of the Four Color Problem, Math. Magazine 49(4), 1976, 219-222.
580. Stern, M., A Review of the book by Olli Lehto. Korkeat Maailmat. Rolf Nevanlinnan elämä, Otava, Helsinki, 2001.
581. Stevens, R. S., and Shanturam, R., Computer generated van der Waerden partitions. Math. Comp. 17(1978), 635-636.
582. Story, W. E., Note on the Preceding Paper. American Journal of Mathematics II (1879), 201-204.
583. Struik, D. J., Letter to A. Soifer, March 3, 1995.
584. Sved, M., Paul Erdös - Portrait of Our New Academician. Austral. Math. Soc. Gaz. 14(3) (1987), 59-62.
585. Sved, M., Old Snapshots of the Young. Geombinatorics II (3) (1993), 46-52.
586. Szabó, Z., An application of Lovász' local lemma - a new lower bound for the van der Waerden number. Random Structures Algorithms 1(3) (1990), 343-360.
587. Székely, L. A., Remarks on the chromatic number of geometric graphs. In M. Fiedler, (ed.), Graphs and other Combinatorial Topics, Proceedings of the Third Czechoslovak Symposium on Graph Theory, Prague, August 24-27, 1982, Teubner Verlaggesellschaft, Leipzig, 1983, 312-315.
588. Székely, L. A., Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space. Combinatorica 4(1984), 213-218.
589. Székely, L. A., Erdös on unit distances and the Szemerédi-Trotter theorems. In G. Halász, et al. (eds.), Paul Erdõs and his Mathematics II, János Bolyai Mathematical Society, Budapest and Springer-Verlag, Berlin, 2002, 649-666.
590. n. Discrete Math. 75(1989), 343-372.
591. Szekeres, Gy., A Combinatorial Problem in Geometry: Remeniscences, in Paul Erdös, The Art of Counting, MIT Press, Cambridge, Massachusetts, 1973, xix-xxii.
592. Szekeres, G., and Peters, L., Computer Solution To the 17-Point Erdõs-Szekeres Problem. ANZIAM J. 48(2006), 151-164.
593. Szemerédi, E., On Sets of integers containing no four elements in arithmetic progression. Acta Math. Acad. Sci. Hungar. 20(1969), 89-104.
594. Szemerédi, E., On sets of integers containing no k elements in arithmetic progression. Acta Arithmetica XXVII (1975), 199-245.
595. Szpiro, G., Das Auswahlaxiom und seine Konsequenzen: Wie viele Farben braught man zur Kolorierung der Ebene? - Je nachdem..., Neue Zü rcher Zeitung, April 13, 2005, Nr. 85, p. 65.
596. Tait, P. G., On the colouring of maps. Proc. Roy. Soc. Edinb. 10(1878-80), 501-503.
597. Tait, P. G., Remarks on the previous communication. Proc. Roy. Soc. Edinb. 10(1878-80), 729.
598. Tait, P. G., Note on a theorem in the geometry of position. Trans. Roy. Soc. Edinb. 29(1880), 657-660
599. & plate XVI. Reprinted: Scientific Papers 1(54), 1898-1900, 408-411 & plate X.
600. Tietze, H., Über das Problem der Nachbargebiete im Raume. Monatschefte fü r Mathematik und Physik 16(1905), 211-216.
601. Tietze, H., Gelöste und ungelöste mathematische Probleme aus alter und neuer Zeit; vierzehn Vorlesungen für Laien und für Freunde der Mathematik, München, Biederstein, 1949.
602. English translation from the 2nd rev. German ed: Famous Problems of Mathematics: Solved and Unsolved Mathematical Problems, from Antiquity to Modern Times. Graylock Press, Baltimore, 1965.
603. Thomassen, C., On the Nelson unit distance coloring problem. Amer. Math. Monthly 106(1999), 850-853.
604. Whoosh, Time, December 26, 1949, 30.
605. Tóth, G., and Valtr, P., Note on the Erdös-Szekeres theorem, Discrete and Computational Geometry 19(1998), 457-459.
606. Tóth, G., and Valtr, P., The Erdös-Szekeres theorem, upper bounds and generalizations. in J. E. Goodman et al. (eds.), Discrete and Computational Geometry - Papers from the MSRI Special Program, MSRI Publications 52, Cambridge University Press, Cambridge (2005), 557-568.
607. Townsend, S. P., Every 5-Colouring Map in the Plane Contains a Monochrome Unit. J. Combin. Theory, Ser. A, 30(1981), 114-115.
608. Townsend, S. P., Colouring the plane with no monochrome unit. Geombinatorics XIV (4) (2005), 181-193.
609. Tymozcko, T., The four-color problem and its philosophical significance. J. Philosophy 76(2) (1979), 57-83.
610. Ungar, P., Problem 4526, advanced problems and solutions. Amer. Math. Monthly 60(1953), 123; correction 60(1953), 336.
611. Vasiliev, N. B., and Egorov, A., Zadachi Vsesoyuznykh Matematicheskikh Olimpiad (Problems of Soviet National Mathematical Olympiads), Nauka, Moscow, 1988.
612. Vizing, V. G., Ob ozenke khromaticheskogo klassa p - grapha (On an estimate of the chromatic class of a p-graph). Diskrenyi Analiz 3(1964), 25-30 (Russian).
613. Vizing, V. G., Kriticheskie graphy s khromaticheskim klassom (Critical graphs with the given chromatic class), Diskrenyi Analiz 5(1965), 9-17 (Russian).
614. Vizing, V. G., Nekotorye Nereshennye Zadachi V teorii grafov. Uspekhi Mat. Nauk XXIII (6) (1968), 117-134 (Russian).
615. English Translation: Some unsolved problems in graph theory. Russian Mathematical Surveys 23(1968), 125-141.
616. Waerden, B. L. Van Der, De algebraiese Grondslagen der meetkunde van het aantal [Ph. D. thesis], Zutphen - W. J. Thieme & Cie, 1926.
617. Waerden, B. L. Van Der, Beweis einer Baudetschen Vermutung. Nieuw Archief voor Wiskunde 15(1927), 212-216.
618. Waerden, B. L. Van Der, Moderne Algebra, vol. 1 (1930) and 2(1931), 1st edn., Verlag von Julius Springer, Berlin.
619. Waerden, B. L. Van Der, Die Gruppentheoretische Methode in der Quantenmechanik, J. Springer, 1932.
620. Waerden, B. L. Van Der, Nachruf auf Emmy Noether. Math. Annalen 111(1935), 469-476.
621. Waerden, B. L. Van Der, Moderne Algebra, vol. 1 (1937) and 2(1940), 2nd edn., Verlag von Julius Springer, Berlin.
622. Waerden, B. L. Van Der, Letter to Behnke, May 10, 1940, Erich Hecke's Papers, Private German Collection.
623. Waerden, B. L. Van Der, Letter to Hecke, May 16, 1940, Erich Hecke's Papers, Private German Collection.
624. Waerden, B. L. Van Der, Prof. Van Der Waerden verweert zich. Het Parool No. 326, February 1, 1946, 3.
625. Waerden, B. L. Van Der, Rechtzetting, Proria Cures, February 1, 1946.
626. Waerden, B. L. Van Der, Moderne Algebra, vol. 1 and 2, 3rd edn., Springer-Verlag, Berlin, 1950.
627. Waerden, B. L. Van Der, Over de Ruimte, Rede, 4 December 1950, P. Noordhoff N. V., Groningen-Djakarta, 1950.
628. Waerden, B. L. Van Der, Einfall und Überlegung in der Mathematik, 1. Mitteilung. Elem. Math. VIII (6) (1953), 121-144;
629. Mitteilung, Elem. Math. IX (1) (1954), 1-24;
630. Mitteilung: der Beweis der Vermutung von Baudet, Elem. Math. IX (3) (1954), 49-72, (German).
631. Waerden, B. L. Van Der, Einfall und Überlegung: Drei Kleine Beiträge zur Psychologie des Mathematischen Denkens (Idea and Reflection: Three Little Contributions to the Psychology of the Mathematical Thinking. In 3 parts; 3rd part: der Beweis der Vermutung von Baudet), Birkhäuser, Basel, 1954 (German).
632. Waerden, B. L. Van Der, Science Awakening. P. Noordhoff, Groningen, 1954. Expanded edition, Oxford University Press, New York, 1961.
633. Waerden, B. L. Van Der, Wie der Beweis der Vermutung von Baudet gefunden wurde. Abhandlungen aus dem Mathematischen Seminar der Hamburgischen Universität 28(1965), 6-15.
634. Waerden, B. L. Van Der, letter to Henry Baudet, October 20, 1965.
635. Waerden, B. L. Van Der, How the proof of Baudet's conjecture was found. In L. Mirsky (ed.), Studies in Pure Mathematics, Academic Press, London, 1971, 251-260.
636. Waerden, B. L. Van Der, Letter to N. G. de Bruijn, April 5, 1977.
637. Waerden, B. L. Van Der, On the Sources of My Book Moderne Algebra, Historia Mathematica 2(1975), 31-40.
638. Waerden, B. L. Van Der, Beweis einer Baudetschen Vermutung, Bertin, E. M. J. et al. (eds.), Two Decades of Mathematics in the Netherlands 1920-1940: A Retrospection on the Occasion of the Bicentennial of the Wiskundig Genootschap, Part I, Mathematical Center, Amsterdam, 1978, 110-115 (with Commentary by N. G. de Bruijn, 116-124).
639. Waerden, B. L. Van Der, A History of Algebra. Springer, Berlin, 1985.
640. Waerden, B. L. Van Der, Letter to Soifer, A., March 9, 1995.
641. Waerden, B. L. Van Der, Letter to Soifer, A., April 4, 1995.
642. Waerden, B. L. Van Der, Undated letter to Soifer, A., (Swiss Post Office seal April 24, 1995).
643. Waerden, B. L. Van Der, Wie der Beweis der Vermutung von Baudet gefunden wurde. Elem. Math. 53(1998), 139-148.
644. Waerden, Dorith Van Der, e-mail to A. Soifer, February 22, 2004.
645. Waerden, Dorith Van Der, e-mail to A. Soifer, April 29, 2004.
646. Waerden, Dorith Van Der, e-mail to A. Soifer, June 14, 2004.
647. Waerden, Dorith Van Der, e-mail to A. Soifer, June 14, 2004.
648. Waerden, Theo Van Der, letter to A. Soifer, June 25, 2004.
649. Waerden, Theo Van Der, letter to A. Soifer, November, 2005.
650. Waerden, Theo Van Der, letter to A. Soifer, November, 2005.
651. Wagner, K., Über eine Eigenschaft der ebenen Komplexe. Math. Ann. 114(1937), 570-590.
652. Walker, M., Uranium Machines, Nuclear Explosives, and National Socialism: The German Quest for Nuclear Power, 1939-1949, Ph. D. Dissertation in the History of Science, Princeton University, October 1987.
653. Walker, M., Nazi Science: Myth, Truth, and the German Atomic Bomb. Plenum, New York, 1995.
654. Wernicke, P., Über den kartographischen Vierfarbensatz. Math. Ann. 58(3) (1904), 413-426.
655. Whitney, H., and Tutte, W. T., Kempe chains and the four colour problem. Utilitas Math. 2(1972), 241-281.
656. Wilson, R. J., New Light on the origin of the Four-color Conjecture. Historia Mathematica 3(1976), 329-330.
657. Wilson, R. J., Four Colours Suffice. Princeton University Press, 2002.
658. Wilson, J., New light on the origin of the four-color conjecture. Hist. Math. 3(1976), 329-330.
659. Wilson, J. C., On a supposed solution of the 'four-colour problem'. Math. Gaz. 3(1904-6), 338-340.
660. Witt, E., Ein kombinatorischer Satz der Elementargeometrie. Mathematische Nachrichten 6(1952), 261-262.
661. Wittgenstein, L., Remarks on the Foundation of Mathematics. Macmillan, New York, 1956.
662. Woodall, D. R., Distances realized by sets covering the plane. J. Combin. Theory Ser. A, 14(1973), 187-200.
663. Woodall, D. R., The four-colour conjecture is proved. Manifold 19(1977), 14-22.
664. Woodall, D. R., The four-colour theorem. Bull. Inst. Math. & Appl. 14(1978), 245-249.
665. Woodall, D. R., and Wilson, R. J., The Appel-Haken Proof of the Four-Color Theorem. In L. Beineke and R. J. Wilson (eds.), Selected Topics in Graph Theory, Academic Press, London, 1978, 83-101.
666. Wormald, N. C., A 4-chromatic graph with a special plane drawing. J. Austral. Math. Soc. Series A 28(1979), 1-8.
667. Xu, B., On 3-colorable plane graphs withouit 5- and 7-cycles. J. Combin. Theory Ser. B 96(2006), 958-963.
668. Xu, B., A 3-color theorem on plane graphs without 5-circuits. Acta Mathematica Sinica (in press).
669. Xu, B., A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits, submitted.0
670. Xu, X., Xie, Z., Exoo, G., and Radziszowski, S. P., Constructive lower bounds on classical multicolor Ramsey numbers. Electronic J. Combinatorics, #R35, 11 (2004). http://www.combinatorics.org
671. Xu, X., Xie, Z, and Radziszowski, S. P., A Constructive Approach for the Lower Bounds on the Ramsey Numbers R (s, t). J. Graph Theory 47 (2004) 231-239.
672. Zaks, J., On the chromatic number of some rational spaces. Combinatorics and Optimization, Research Report Corr 88-26(1988), 1-3.
673. Zaks, J., On four-colourings of the rational four-space. Aequationes Math. 27(1989), 259-266.
674. Zaks, J., On the connectedness of some geometric graphs. J. Combin. Theory (B), 49(1990), 143-150.
675. Zaks, J., On the chromatic number of some rational spaces. Ars Combinatorica 33(1992), 253-256.
676. Zaks, J., On the connectedness of some geometric graphs, J. Combin. Theory (B), 49 (1990) 143-150.
677. Zaks, J., Uniform distances in rational unit-distance graphs. Discrete Math. 109(1-3), 1992), 307-311.
678. Zaks, J., On odd integral distances rational graphs. Geombinatorics IX (2) (1999), 90-95.
679. Zermelo, E., Beweis dass jede Menge wohlgeordnet werden kann. Math. Ann. 59(1904), 514-516.
680. Zykov, A. A., On some properties of linear complexes, (Russian). Mat. Sbornik N. S. 24(66) (1949), 163-188.
681. On some properties of linear complexes. Amer. Math. Soc. Translation 1952, (1952). no. 79.
682. Zykov, A. A., Problem 12 (by V. G. Vizing), Beiträge zur Graphentheorie, Vorgetragen auf dem Internationalen Kolloquium in Manebach (DDR) vom 9.-12. Mai 1967, p. 228. B. G. Teubner Verlagsgesellschaft, Leipzig, 1968.
683. Zykov, A. A., Theory of Finite Graphs I, (Russian), Nauka, Novosibirsk, 1969.