Proofs from the book: Fifth edition

Proofs from The Book: Fifth Edition

Volumn , Issue , 2014, Pages 1-308

  Aigner, Martin ^a   Ziegler, Günter M ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84930739038     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-662-44205-0     Document Type: Book

References (260)

1. B. ARTMANN: Euclid-The Creation of Mathematics, Springer-Verlag, New York 1999.
2. C. ELSHOLTZ: Prime divisors of thin sequences, Amer. Math. Monthly 119 (2012), 331-333.
3. P. ERDOS: Über die Reihe ∑1/p , Mathematica, Zutphen B 7 (1938), 1-2.
4. L. EULER: Introductio in Analysin Infinitorum, Tomus Primus, Lausanne 1748; Opera Omnia, Ser. 1, Vol. 8.
5. H. FÜRSTENBERG: On the infinitude of primes, Amer. Math. Monthly 62 (1955), 353.
6. I. SCHUR: Über die Existenz unendlich vieler Primzahlen in einigen speziellen arithmetischen Progressionen, Sitzungsberichte der Berliner Math. Gesellschaft 11 (1912), 40-50.
7. P. ERDOS: Beweis eines Satzes von Tschebyschef, Acta Sci. Math. (Szeged) 5 (1930-32), 194-198.
8. R. L. GRAHAM, D. E. KNUTH & O. PATASHNIK: Concrete Mathematics. A Foundation for Computer Science, Addison-Wesley, Reading MA 1989.
9. G. H. HARDY & E. M. WRIGHT: An Introduction to the Theory of Numbers, Fifth edition, Oxford University Press 1979.
10. P. RIBENBOIM: The New Book of Prime Number Records, Springer-Verlag, New York 1989.
11. P. ERDÖS: A theorem of Sylvester and Schur, J. London Math. Soc. 9 (1934), 282-288.
12. P. ERDÖS: On a diophantine equation, J. London Math. Soc. 26 (1951), 176-178.
13. J. J. SYLVESTER: On arithmetical series, Messenger of Math. 21 (1892), 1-19, 87-120;
14. Collected Mathematical Papers Vol. 4, 1912, 687-731.
15. F. W. CLARKE,W. N. EVERITT, L. L. LITTLEJOHN& S. J. R. VORSTER: H. J. S. Smith and the Fermat Two Squares Theorem, Amer. Math. Monthly 106 (1999), 652-665.
16. D. R. HEATH-BROWN: Fermat's two squares theorem, Invariant (1984), 2-5.
17. I. NIVEN & H. S. ZUCKERMAN: An Introduction to the Theory of Numbers, Fifth edition, Wiley, New York 1972.
18. H. RIESEL: Prime Numbers and Computer Methods for Factorization, Second edition, Progress in Mathematics 126, Birkhäuser, Boston MA 1994.
19. M. RUBINSTEIN& P. SARNAK: Chebyshev's bias, Experimental Mathematics 3 (1994), 173-197.
20. A. THUE: Et par antydninger til en taltheoretisk metode, Kra. Vidensk. Selsk. Forh. 7 (1902), 57-75.
21. S. WAGON: Editor's corner: The Euclidean algorithm strikes again, Amer. Math. Monthly 97 (1990), 125-129.
22. D. ZAGIER: A one-sentence proof that every prime p ≡ 1 (mod 4) is a sum of two squares, Amer. Math. Monthly 97 (1990), 144.
23. A. BAKER: A Concise Introduction to the Theory of Numbers, Cambridge University Press, Cambridge 1984.
24. F. G. EISENSTEIN: Geometrischer Beweis des Fundamentaltheorems für die quadratischen Reste, J. Reine Angewandte Mathematik 28 (1844), 186-191.
25. C. F. GAUSS: Theorema arithmetici demonstratio nova, Comment. Soc. regiae sci. Göttingen XVI (1808), 69; Werke II, 1-8 (contains the 3rd proof).
26. C. F. GAUSS: Theorematis fundamentalis in doctrina de residuis quadraticis demonstrationes et amplicationes novae (1818), Werke II, 47-64 (contains the 6th proof).
27. F. LEMMERMEYER: Reciprocity Laws, Springer-Verlag, Berlin 2000.
28. L. E. DICKSON: On finite algebras, Nachrichten der Akad. Wissenschaften Göttingen Math.-Phys. Klasse (1905), 1-36;
29. Collected Mathematical Papers Vol. III, Chelsea Publ. Comp, The Bronx, NY 1975, 539-574.
30. J. H. M. WEDDERBURN: A theorem on finite algebras, Trans. Amer. Math. Soc. 6 (1905), 349-352.
31. E. WITT: Über die Kommutativität endlicher Schiefkörper, Abh. Math. Sem. Univ. Hamburg 8 (1931), 413.
32. J. HADAMARD: Résolution d'une question relative aux déterminants, Bulletin des Sciences Mathématiques 17 (1893), 240-246.
33. G. SZEKERES & P. TURÁN: An extremal problem in the theory of determinants, in: "Collected Papers of Paul Turan" (P. Erdös, ed.), Akadémiai Kiadür Budapest 1990, Vol. 1, pp. 81-87.
34. H. WILF: An algorithm-inspired proof of the spectral theorem in En, Amer. Math. Monthly 88 (1981), 49-50.
35. H. WILF: Some examples of combinatorial averaging, Amer. Math. Monthly 92 (1985), 250-261.
36. C. HERMITE: Sur la fonction exponentielle, Comptes rendus de l'Académie des Sciences (Paris) 77 (1873), 18-24;
37. OEuvres de Charles Hermite, Vol. III, Gauthier-Villars, Paris 1912, pp. 150-181.
38. Y. IWAMOTO: A proof that π2 is irrational, J. Osaka Institute of Science and Technology 1 (1949), 147-148.
39. J. F. KOKSMA: On Niven's proof that π is irrational, Nieuw Archief voor Wiskunde (2) 23 (1949), 39.
40. J. LIOUVILLE: Sur l'irrationalitürdu nombre e = 2,718., Journal de Mathématiques Pures et Appl. (1) 5 (1840), 192; Addition, 193-194.
41. I. NIVEN: A simple proof that π is irrational, Bulletin Amer. Math. Soc. 53 (1947), 509.
42. K. BALL & T. RIVOAL: Irrationalitürd'une infinitürde valeurs de la fonction zêta aux entiers impairs, Inventiones math. 146 (2001), 193-207.
43. F. BEUKERS, J. A. C. KOLK & E. CALABI: Sums of generalized harmonic series and volumes, Nieuw Archief voor Wiskunde (4) 11 (1993), 217-224.
44. J. M. BORWEIN, P. B. BORWEIN & K. DILCHER: Pi, Euler numbers, and asymptotic expansions, Amer. Math. Monthly 96 (1989), 681-687.
45. S. FISCHLER: Irrationalitürde valeurs de zêta (d'apres Apery, Rivoal, . . .), Bourbaki Seminar, No. 910, November 2002; Asterisque 294 (2004), 27-62.
46. J. C. LAGARIAS: An elementary problem equivalent to the Riemann hypothesis, Amer. Math. Monthly 109 (2002), 534-543.
47. W. J. LEVEQUE: Topics in Number Theory, Vol. I, Addison-Wesley, Reading MA 1956.
48. A. M. YAGLOM & I.M. YAGLOM: Challenging mathematical problems with elementary solutions, Vol. II, Holden-Day, Inc., San Francisco, CA 1967.
49. D. ZAGIER: Values of zeta functions and their applications, Proc. First European Congress of Mathematics, Vol. II (Paris 1992), Progress in Math. 120, Birkhäuser, Basel 1994, pp. 497-512.
50. W. ZUDILIN: Arithmetic of linear forms involving odd zeta values, J. Theorie Nombres Bordeaux 16 (2004), 251-291.
51. V. G. BOLTIANSKII: Hilbert's Third Problem, V. H.Winston & Sons (Halsted Press, John Wiley & Sons), Washington DC 1978.
52. D. BENKO: A new approach to Hilbert's third problem, Amer. Math. Monthly, 114 (2007), 665-676.
53. M. DEHN: Ueber raumgleiche Polyeder, Nachrichten von der Konigl. Gesellschaft der Wissenschaften, Mathematisch-physikalische Klasse (1900), 345-354.
54. M. DEHN: Ueber den Rauminhalt, Mathematische Annalen 55 (1902), 465-478.
55. C. F. GAUSS: "Congruenz und Symmetrie": Briefwechsel mit Gerling, pp. 240-249 in: Werke, Band VIII, Konigl. Gesellschaft der Wissenschaften zu Göttingen; B. G. Teubner, Leipzig 1900.
56. D. HILBERT: Mathematical Problems, Lecture delivered at the International Congress of Mathematicians at Paris in 1900, Bulletin Amer. Math. Soc. 8 (1902), 437-479.
57. B. KAGAN: Über die Transformation der Polyeder, Mathematische Annalen 57 (1903), 421-424.
58. G. M. ZIEGLER: Lectures on Polytopes, Graduate Texts in Mathematics 152, Springer, New York 1995/1998.
59. N. G. DE BRUIJN & P. ERDÖS: On a combinatorial problem, Proc. Kon. Ned. Akad. Wetensch. 51 (1948), 1277-1279.
60. H. S. M. COXETER: A problem of collinear points, Amer. Math. Monthly 55 (1948), 26-28 (contains Kelly's proof).
61. P. ERDÖS: Problem 4065-Three point collinearity, Amer.Math. Monthly 51 (1944), 169-171 (contains Gallai's proof).
62. R. L. GRAHAM& H. O. POLLAK: On the addressing problem for loop switching, Bell System Tech. J. 50 (1971), 2495-2519.
63. B. GREEN & T. TAO: On sets defining few ordinary lines, Discrete Comput. Geometry 50 (2013), 409-468.
64. J. J. SYLVESTER: Mathematical Question 11851, The Educational Times 46 (1893), 156.
65. H. TVERBERG: On the decomposition of Kn into complete bipartite graphs, J. Graph Theory 6 (1982), 493-494.
66. J. E. GOODMAN & R. POLLACK: A combinatorial perspective on some problems in geometry, Congressus Numerantium 32 (1981), 383-394.
67. R. E. JAMISON & D. HILL: A catalogue of slope-critical configurations, Congressus Numerantium 40 (1983), 101-125.
68. P. R. SCOTT: On the sets of directions determined by n points, Amer. Math. Monthly 77 (1970), 502-505.
69. P. UNGAR: 2N noncollinear points determine at least 2N directions, J. Combinatorial Theory, Ser. A 33 (1982), 343-347.
70. G. D. CHAKERIAN: Sylvester's problem on collinear points and a relative, Amer. Math. Monthly 77 (1970), 164-167.
71. D. EPPSTEIN: Nineteen proofs of Euler's formula: V - E + F = 2, in: The Geometry Junkyard, http://www.ics.uci.edu/~eppstein/junkyard/euler/.
72. G. PICK: Geometrisches zur Zahlenlehre, Sitzungsberichte Lotos (Prag), Natur-med. Verein für Bumen 19 (1899), 311-319.
73. K. G. C. VON STAUDT: Geometrie der Lage, Verlag der Fr. Korn'schen Buchhandlung, Nürnberg 1847.
74. N. E. STEENROD: Solution 4065/Editorial Note, Amer. Math. Monthly 51 (1944), 170-171.
75. A. CAUCHY: Sur les polygones et les polyeres, seconde mémoire, J. Ecole Polytechnique XVIe Cahier, Tome IX (1813), 87-98;
76. OEuvres Complenes, IIe Seie, Vol. 1, Paris 1905, 26-38.
77. R. CONNELLY: A counterexample to the rigidity conjecture for polyhedra, Inst. Haut. Etud. Sci., Publ. Math. 47 (1978), 333-338.
78. R. CONNELLY: The rigidity of polyhedral surfaces, Mathematics Magazine 52 (1979), 275-283.
79. I. KH. SABITOV: The volume as a metric invariant of polyhedra, Discrete Comput. Geometry 20 (1998), 405-425.
80. J. SCHOENBERG & S.K. ZAREMBA: On Cauchy's lemma concerning convex polygons, Canadian J. Math. 19 (1967), 1062-1071.
81. H. BRUNN: Über Verkettung, Sitzungsberichte der Bayerischen Akad. Wiss. Math.-Phys. Klasse 22 (1892), 77-99.
82. M. EPPLE: Die Entstehung der Knotentheorie, Vieweg, Braunschweig/ Wiesbaden 1999.
83. R. H. FOX: A quick trip through knot theory, in: "Topology of 3-manifolds and Related Topics" (M. K. Fort, ed.), Prentice-Hall Inc., 1962, pp. 120-167.
84. M. FREEDMAN& R. SKORA: Strange actions on groups of spheres, J. Differential Geometry 25 (1987), 75-98.
85. O. NANYES: An elementary proof that the Borromean rings are nonsplittable, Amer. Math. Monthly 100 (1993), 786-789.
86. K. REIDEMEISTER: Elementare Begrürdung der Knotentheorie, Abh. Math. Sem. Univ. Hamburg 5 (1926), 24-32.
87. P. G. TAIT: On knots, Transactions Royal Soc. Edinburgh 28 (1876-77), 145-190.
88. F. BAGEMIHL: A conjecture concerning neighboring tetrahedra, Amer. Math. Monthly 63 (1956) 328-329.
89. V. J. D. BASTON: Some Properties of Polyhedra in Euclidean Space, Pergamon Press, Oxford 1965.
90. M. A. PERLES: At most 2d+1 neighborly simplices in Ed, Annals of Discrete Math. 20 (1984), 253-254.
91. J. ZAKS: Neighborly families of 2d d-simplices in Ed, Geometriae Dedicata 11 (1981), 279-296.
92. J. ZAKS: No Nine Neighborly Tetrahedra Exist, Memoirs Amer. Math. Soc. No. 447, Vol. 91, 1991.
93. L. DANZER & B. GRÜNBAUM: Über zwei Probleme bezürlich konvexer Körper von P. Erde und von V. L. Klee, Math. Zeitschrift 79 (1962), 95-99.
94. P. ERDÖS & Z. FÜREDI: The greatest angle among n points in the d-dimensional Euclidean space, Annals of Discrete Math. 17 (1983), 275-283.
95. H. MINKOWSKI: Dichteste gitterförmige Lagerung kongruenter Körper, Nachrichten Ges. Wiss. Göttingen, Math.-Phys. Klasse 1904, 311-355.
96. A. V. BONDARENKO: On Borsuk's conjecture for two-distance sets, Discrete Comput. Geometry 51 (2014), 509-515.
97. K. BORSUK: Drei Sätze über die n-dimensionale euklidische Sphäre, Fundamenta Math. 20 (1933), 177-190.
98. P. FRANKL & R. WILSON: Intersection theorems with geometric consequences, Combinatorica 1 (1981), 259-286.
99. J. KAHN & G. KALAI: A counterexample to Borsuk's conjecture, Bulletin Amer. Math. Soc. 29 (1993), 60-62.
100. A. NILLI: On Borsuk's problem, in: "Jerusalem Combinatorics '93" (H. Barcelo and G. Kalai, eds.), Contemporary Mathematics 178, Amer. Math. Soc. 1994, 209-210.
101. A. M. RAIGORODSKII: On the dimension in Borsuk's problem, Russian Math. Surveys (6) 52 (1997), 1324-1325.
102. O. SCHRAMM: Illuminating sets of constant width, Mathematika 35 (1988), 180-199.
103. B. WEISSBACH: Sets with large Borsuk number, Beiträge zur Algebra und Geometrie/Contributions to Algebra and Geometry 41 (2000), 417-423.
104. G. M. ZIEGLER: Coloring Hamming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions, Lecture Notes in Computer Science 2122, Springer-Verlag 2001, 164-175.
105. L. E. J. BROUWER: Beweis der Invarianz der Dimensionszahl, Math. Annalen 70 (1911), 161-165.
106. N. CALKIN & H. WILF: Recounting the rationals, Amer. Math. Monthly 107 (2000), 360-363.
107. G. CANTOR: Ein Beitrag zur Mannigfaltigkeitslehre, Journal für die reine und angewandte Mathematik 84 (1878), 242-258.
108. P. COHEN: Set Theory and the Continuum Hypothesis, W. A. Benjamin, New York 1966.
109. P. ERDÖS: An interpolation problem associated with the continuum hypothesis, Michigan Math. J. 11 (1964), 9-10.
110. E. KAMKE: Theory of Sets, Dover Books 1950.
111. M. A. STERN: Ueber eine zahlentheoretische Funktion, Journal für die reine und angewandte Mathematik 55 (1858), 193-220.
112. H. ALZER: A proof of the arithmetic mean-geometric mean inequality, Amer. Math. Monthly 103 (1996), 585.
113. P. S. BULLEN, D. S. MITRINOVICS & P. M. VASIC: Means and their Inequalities, Reidel, Dordrecht 1988.
114. P. ERDÖS & T. GRÜNWALD: On polynomials with only real roots, Annals Math. 40 (1939), 537-548.
115. G. H. HARDY, J. E. LITTLEWOOD & G. PÓLYA: Inequalities, Cambridge University Press, Cambridge 1952.
116. W. MANTEL: Problem 28, Wiskundige Opgaven 10 (1906), 60-61.
117. G. PÓLYA: Review of [3], Mathematical Reviews 1 (1940), 1.
118. G. PÓLYA& G. SZEGÖ: Problems and Theorems in Analysis, Vol. I, Springer-Verlag, Berlin Heidelberg New York 1972/78; Reprint 1998.
119. J. D'ALEMBERT: Recherches sur le calcul intégral, Histoire de l'Académie Royale des Sciences et Belles Lettres (1746), 182-224.
120. R. ARGAND: Réflexions sur la nouvelle théorie d'analyse, Annales de Mathématiques 5 (1814), 197-209.
121. C. FEFFERMAN: An easy proof of the fundamental theorem of algebra, Amer. Math. Monthly 74 (1967), 854-855.
122. E. NETTO & R. LE VAVASSEUR: Les fonctions rationelles, Enc. Sciences Math. Pures Appl. I 2 (1907), 1-232.
123. R. M. REDHEFFER: What! Another note just on the fundamental theorem of algebra? Amer. Math. Monthly 71 (1964), 180-185.
124. R. REMMERT: The fundamental theorem of algebra, Chapter 4 in: "Numbers" (H. D. Ebbinghaus et al., eds.), Graduate Texts in Mathematics 123, Springer, New York 1991.
125. N. JACOBSON: Lectures in Abstract Algebra, Part III: Theory of Fields and Galois Theory, Graduate Texts in Mathematics 32, Springer, New York 1975.
126. P. MONSKY: On dividing a square into triangles, Amer. Math. Monthly 77 (1970), 161-164.
127. F. RICHMAN & J. THOMAS: Problem 5471, Amer. Math. Monthly 74 (1967), 329.
128. S. K. STEIN & S. SZABÓ: Algebra and Tiling: Homomorphisms in the Service of Geometry, Carus Math. Monographs 25, MAA, Washington DC 1994.
129. J. THOMAS: A dissection problem, Math. Magazine 41 (1968), 187-190.
130. P. L. CEBYCEV: OEuvres, Vol. I, Acad. Imperiale des Sciences, St. Petersburg 1899, pp. 387-469.
131. G. PÓLYA: Beitrag zur Verallgemeinerung des Verzerrungssatzes auf mehrfach zusammenhängenden Gebieten, Sitzungsber. Preuss. Akad. Wiss. Berlin (1928), 228-232;
132. Collected Papers Vol. I, MIT Press 1974, 347-351.
133. G. PÓLYA&G. SZEGÖ: Problems and Theorems in Analysis, Vol. II, Springer-Verlag, Berlin Heidelberg New York 1976; Reprint 1998.
134. P. ERDÖS: On a lemma of Littlewood and Offord, Bulletin Amer. Math. Soc. 51 (1945), 898-902.
135. G. KATONA: On a conjecture of Erdös and a stronger form of Sperner's theorem, Studia Sci. Math. Hungar. 1 (1966), 59-63.
136. D. KLEITMAN: On a lemma of Littlewood and Offord on the distribution of certain sums, Math. Zeitschrift 90 (1965), 251-259.
137. D. KLEITMAN: On a lemma of Littlewood and Offord on the distributions of linear combinations of vectors, Advances Math. 5 (1970), 155-157.
138. J. E. LITTLEWOOD & A. C. OFFORD: On the number of real roots of a random algebraic equation III, Mat. USSR Sb. 12 (1943), 277-285.
139. S. BOCHNER: Book review of "Gesammelte Schriften" by Gustav Herglotz, Bulletin Amer. Math. Soc. 1 (1979), 1020-1022.
140. J. ELSTRODT: Partialbruchzerlegung des Kotangens, Herglotz-Trick und die Weierstraßsche stetige, nirgends differenzierbare Funktion, Math. Semesterberichte 45 (1998), 207-220.
141. L. EULER: Introductio in Analysin Infinitorum, Tomus Primus, Lausanne 1748; Opera Omnia, Ser. 1, Vol. 8. In English: Introduction to Analysis of the Infinite, Book I (translated by J. D. Blanton), Springer-Verlag, New York 1988.
142. L. EULER: Institutiones calculi differentialis cum ejus usu in analysi finitorum ac doctrina serierum, Petersburg 1755; Opera Omnia, Ser. 1, Vol. 10.
143. E. BARBIER: Note sur le problème de l'aiguille et le jeu du joint couvert, J. Mathématiques Pures et Appliquées (2) 5 (1860), 273-286.
144. L. BERGGREN, J. BORWEIN & P. BORWEIN, EDS.: Pi: A Source Book, Springer-Verlag, New York 1997.
145. G. L. LECLERC, COMTE DE BUFFON: Essai d'arithmétique morale, Appendix to "Histoire naturelle générale et particulière," Vol. 4, 1777.
146. D. A. KLAIN& G.-C. ROTA: Introduction to Geometric Probability, "Lezioni Lincee," Cambridge University Press 1997.
147. T. H. O'BEIRNE: Puzzles and Paradoxes, Oxford University Press, London 1965.
148. L. E. J. BROUWER: Über Abbildungen von Mannigfaltigkeiten, Math. Annalen 71 (1912), 97-115.
149. W. G. BROWN: On graphs that do not contain a Thomsen graph, Canadian Math. Bull. 9 (1966), 281-285.
150. P. ERDÖS, A. RÉNYI & V. SÓS: On a problem of graph theory, Studia Sci. Math. Hungar. 1 (1966), 215-235.
151. P. ERDÖS & G. SZEKERES:A combinatorial problem in geometry, Compositio Math. (1935), 463-470.
152. S. HOSTEN & W. D. MORRIS: The order dimension of the complete graph, Discrete Math. 201 (1999), 133-139.
153. I. REIMAN: Über ein Problem von K. Zarankiewicz, Acta Math. Acad. Sci. Hungar. 9 (1958), 269-273.
154. J. SPENCER: Minimal scrambling sets of simple orders, Acta Math. Acad. Sci. Hungar. 22 (1971), 349-353.
155. E. SPERNER: Neuer Beweis für die Invarianz der Dimensionszahl und des Gebietes, Abh. Math. Sem. Hamburg 6 (1928), 265-272.
156. W. T. TROTTER: Combinatorics and Partially Ordered Sets: Dimension Theory, John Hopkins University Press, Baltimore and London 1992.
157. F. ARDILA & R. P. STANLEY: Tilings, Math. Intelligencer (4)32 (2010), 32-43.
158. N. G. DE BRUIJN: Filling boxes with bricks, Amer. Math. Monthly 76 (1969), 37-40.
159. M. DEHN: Über die Zerlegung von Rechtecken in Rechtecke, Mathematische Annalen 57 (1903), 314-332.
160. S. WAGON: Fourteen proofs of a result about tiling a rectangle, Amer. Math. Monthly 94 (1987), 601-617.
161. T. E. EASTERFIELD: A combinatorial algorithm, J. London Math. Soc. 21 (1946), 219-226.
162. P. ERDÖS, C. KO & R. RADO: Intersection theorems for systems of finite sets, Quart. J. Math. (Oxford), Ser. (2) 12 (1961), 313-320.
163. P. HALL: On representatives of subsets, J. London Math. Soc. 10 (1935), 26-30.
164. P. R. HALMOS & H. E. VAUGHAN: The marriage problem, Amer. J. Math. 72 (1950), 214-215.
165. G. KATONA: A simple proof of the Erdös-Ko-Rado theorem, J. Combinatorial Theory, Ser. B 13 (1972), 183-184.
166. L. LOVÁSZ & M. D. PLUMMER: Matching Theory, Akadémiai Kiadó, Budapest 1986.
167. D. LUBELL: A short proof of Sperner's theorem, J. Combinatorial Theory 1 (1966), 299.
168. E. SPERNER: Ein Satz über Untermengen einer endlichen Menge, Math. Zeitschrift 27 (1928), 544-548.
169. D. ALDOUS & P. DIACONIS: Shuffling cards and stopping times, Amer.Math. Monthly 93 (1986), 333-348.
170. D. BAYER & P. DIACONIS: Trailing the dovetail shuffle to its lair, Annals Applied Probability 2 (1992), 294-313.
171. E. BEHRENDS: Introduction to Markov Chains, Vieweg, Braunschweig/ Wiesbaden 2000.
172. P. DIACONIS: Mathematical developments from the analysis of riffle shuffling, in: "Groups, Combinatorics and Geometry. Durham 2001" (A. A. Ivanov, M. W. Liebeck and J. Saxl, eds.), World Scientific, Singapore 2003, pp. 73-97.
173. M. GARDNER: Mathematical Magic Show, Knopf, New York/Allen & Unwin, London 1977.
174. E. N. GILBERT: Theory of Shuffling, Technical Memorandum, Bell Laboratories, Murray Hill NJ, 1955.
175. I. M. GESSEL& G.VIENNOT: Binomial determinants, paths, and hook length formulae, Advances in Math. 58 (1985), 300-321.
176. B. LINDSTRÖM: On the vector representation of induced matroids, Bulletin London Math. Soc. 5 (1973), 85-90.
177. M. AIGNER: Combinatorial Theory, Springer-Verlag, Berlin Heidelberg New York 1979; Reprint 1997.
178. N. L. BIGGS, E. K. LLOYD & R. J. WILSON: Graph Theory 1736-1936, Clarendon Press, Oxford 1976.
179. A. CAYLEY: A theorem on trees, Quart. J. Pure Appl. Math. 23 (1889), 376-378;
180. Collected Mathematical Papers Vol. 13, Cambridge University Press 1897, 26-28.
181. A. JOYAL: Une théorie combinatoire des séries formelles, Advances in Math. 42 (1981), 1-82.
182. J. PITMAN: Coalescent random forests, J. Combinatorial Theory, Ser. A 85 (1999), 165-193.
183. H. PRÜFER: Neuer Beweis eines Satzes über Permutationen, Archiv der Math. u. Physik (3) 27 (1918), 142-144.
184. A. RÉNYI: Some remarks on the theory of trees. MTA Mat. Kut. Inst. Kozl. (Publ. math. Inst. Hungar. Acad. Sci.) 4 (1959), 73-85; Selected Papers Vol. 2, Akadémiai Kiadó, Budapest 1976, 363-374.
185. J. RIORDAN: Forests of labeled trees, J. Combinatorial Theory 5 (1968), 90-103.
186. G. E. ANDREWS: The Theory of Partitions, Encyclopedia of Mathematics and its Applications, Vol. 2, Addison-Wesley, Reading MA 1976.
187. D. BRESSOUD & D. ZEILBERGER: Bijecting Euler's partitions-recurrence, Amer. Math. Monthly 92 (1985), 54-55.
188. A. GARSIA & S. MILNE: A Rogers-Ramanujan bijection, J. Combinatorial Theory, Ser. A 31 (1981), 289-339.
189. S. RAMANUJAN: Proof of certain identities in combinatory analysis, Proc. Cambridge Phil. Soc. 19 (1919), 214-216.
190. L. J. ROGERS: Second memoir on the expansion of certain infinite products, Proc. London Math. Soc. 25 (1894), 318-343.
191. A. S. BESICOVITCH: On Kakeya's problem and a similar one, Math. Zeitschrift 27 (1928), 312-320.
192. F. CUNNINGHAM, JR.: The Kakeya problem for simply connected and for starshaped sets, Amer. Math. Monthly 78 (1971), 114-129.
193. Z. DVIR: On the size of Kakeya sets in finite fields, J. Amer. Math. Soc. 22 (2009), 1093-1097.
194. J. PAL: Über ein elementares Variationsproblem, Det Kgl. Danske Videnskabernes Selskab. Mathematisk-fysiske Meddelelser 2 (1920), 1-35.
195. T. TAO: From rotating needles to stability of waves: emerging connections between combinatorics, analysis, and PDE, Notices Amer.Math. Soc. 48 (2001), 294-303.
196. T. WOLFF: Recent work connected with the Kakeya problem, in: "Prospects in Mathematics (Princeton, NJ 1996)" (H. Rossi, ed.), Amer. Math. Soc., Providence RI 1999, pp. 129-162.
197. T. WOLFF: On some variants of the Kakeya problem, Pacific J. Math. 190 (1999), 111-154.
198. T. EVANS: Embedding incomplete Latin squares, Amer. Math. Monthly 67 (1960), 958-961.
199. C. C. LINDNER: On completing Latin rectangles, Canadian Math. Bulletin 13 (1970), 65-68.
200. H. J. RYSER: A combinatorial theorem with an application to Latin rectangles, Proc. Amer. Math. Soc. 2 (1951), 550-552.
201. B. SMETANIUK: A new construction on Latin squares I: A proof of the Evans conjecture, Ars Combinatoria 11 (1981), 155-172.
202. P. ERDÖS, A. L. RUBIN & H. TAYLOR: Choosability in graphs, Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium 26 (1979), 125-157.
203. D. GALE& L. S. SHAPLEY: College admissions and the stability of marriage, Amer. Math. Monthly 69 (1962), 9-15.
204. F. GALVIN: The list chromatic index of a bipartite multigraph, J. Combinatorial Theory, Ser. B 63 (1995), 153-158.
205. J. C. M. JANSSEN: The Dinitz problem solved for rectangles, Bulletin Amer. Math. Soc. 29 (1993), 243-249.
206. V. G. VIZING: Coloring the vertices of a graph in prescribed colours (in Russian), Metody Diskret. Analiz. 101 (1976), 3-10.
207. N. ALON & J. SPENCER: The Probabilistic Method, Third edition, Wiley-Interscience 2008.
208. L. BRUGMAN: Some properties of nonnegative matrices and their permanents, Soviet Math. Doklady 14 (1973), 945-949.
209. A. KHINCHIN: Mathematical Foundations of Information Theory, Dover Publications 1957.
210. M. LAURENT & A. SCHRIJVER: On Leonid Gurvits's proof for permanents, Amer. Math. Monthly 117 (2010), 903-911.
211. J. H. VAN LINT & R. M. WILSON: A Course in Combinatorics, Second edition, Cambridge University Press 2001.
212. J. RADHAKRISHNAN: An entropy proof of Bregman's theorem, J. Combinatorial Theory, Ser. A 77 (1997), 161-164.
213. A. SCHRIJVER: A short proof of Minc's conjecture, J. Combinatorial Theory, Ser. A 25 (1978), 80-83.
214. H. MINC: Permanents, Encyclopedia of Mathematics and its Applications, Vol. 6, Addison-Wesley, Reading MA 1978; reissued by Cambridge University Press 1984.
215. C. SHANNON: A Mathematical Theory of Communication, Bell System Technical Journal 27 (1948), 379-423, 623-656.
216. N. ALON & M. TARSI: Colorings and orientations of graphs, Combinatorica 12 (1992), 125-134.
217. V. CAMPOS & F. HAVET: 5-choosability of graphs with 2 crossings, Preprint, May 2011, 18 pages, http://arxiv.org/abs/1105.2723.
218. P. ERDÖS, A. L. RUBIN & H. TAYLOR: Choosability in graphs, Proc. West Coast Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium 26 (1979), 125-157.
219. G. GONTHIER: Formal proof-the Four-Color Theorem, Notices of the AMS (11) 55 (2008), 1382-1393.
220. S. GUTNER: The complexity of planar graph choosability, Discrete Math. 159 (1996), 119-130.
221. N. ROBERTSON, D. P. SANDERS, P. SEYMOUR & R. THOMAS: The fourcolour theorem, J. Combinatorial Theory, Ser. B 70 (1997), 2-44.
222. C. THOMASSEN: Every planar graph is 5-choosable, J. Combinatorial Theory, Ser. B 62 (1994), 180-181.
223. M. VOIGT: List colorings of planar graphs, Discrete Math. 120 (1993), 215-219.
224. M. VOIGT & B. WIRTH: On 3-colorable non-4-choosable planar graphs, J. Graph Theory 24 (1997), 233-235.
225. V. CHVÁTAL: A combinatorial theorem in plane geometry, J. Combinatorial Theory, Ser. B 18 (1975), 39-41.
226. S. FISK: A short proof of Chvátal's watchman theorem, J. Combinatorial Theory, Ser. B 24 (1978), 374.
227. J. O'ROURKE: Art Gallery Theorems and Algorithms, Oxford University Press 1987.
228. E. SCHÖNHARDT: Über die Zerlegung von Dreieckspolyedern in Tetraeder, Math. Annalen 98 (1928), 309-312.
229. M. AIGNER: Turán's graph theorem, Amer. Math. Monthly 102 (1995), 808-816.
230. N. ALON & J. SPENCER: The Probabilistic Method, Third edition, Wiley-Interscience 2008.
231. P. ERDÖS: On the graph theorem of Turán (in Hungarian), Math. Fiz. Lapok 21 (1970), 249-251.
232. T. S. MOTZKIN & E. G. STRAUS: Maxima for graphs and a new proof of a theorem of Turán, Canad. J. Math. 17 (1965), 533-540.
233. P. TURÁN: On an extremal problem in graph theory, Math. Fiz. Lapok 48 (1941), 436-452.
234. V. CHVÁTAL: Linear Programming, Freeman, New York 1983.
235. W. HAEMERS: Eigenvalue methods, in: "Packing and Covering in Combinatorics" (A. Schrijver, ed.), Math. Centre Tracts 106 (1979), 15-38.
236. L. LOVÁSZ: On the Shannon capacity of a graph, IEEE Trans. Information Theory 25 (1979), 1-7.
237. C. E. SHANNON: The zero-error capacity of a noisy channel, IRE Trans. Information Theory 3 (1956), 3-15.
238. I. BÁRÁNY: A short proof of Kneser's conjecture, J. Combinatorial Theory, Ser. B 25 (1978), 325-326.
239. K. BORSUK: Drei Sätze über die n-dimensionale Sphäre, Fundamenta Math. 20 (1933), 177-190.
240. D. GALE: Neighboring vertices on a convex polyhedron, in: "Linear Inequalities and Related Systems" (H. W. Kuhn, A. W. Tucker, eds.), Princeton University Press, Princeton 1956, 255-263.
241. J. E. GREENE: A new short proof of Kneser's conjecture, American Math. Monthly 109 (2002), 918-920.
242. M. KNESER: Aufgabe 360, Jahresbericht der Deutschen Mathematiker-Vereinigung 58 (1955), 27.
243. L. LOVÁSZ: Kneser's conjecture, chromatic number, and homotopy, J. Combinatorial Theory, Ser. B 25 (1978), 319-324.
244. L. LYUSTERNIK & S. SHNIREL'MAN: Topological Methods in Variational Problems (in Russian), IssledowatelskiѤ Institute Matematiki i Mechaniki pri O. M. G. U., Moscow, 1930.
245. J. MATOUŠEK: Using the Borsuk-Ulam Theorem. Lectures on Topological Methods in Combinatorics and Geometry, Universitext, Springer-Verlag, Berlin 2003.
246. J. MATOUŠEK: A combinatorial proof of Kneser's conjecture, Combinatorica 24 (2004), 163-170.
247. P. ERDÖS, A. RÉNYI & V. SÓS: On a problem of graph theory, Studia Sci. Math. 1 (1966), 215-235.
248. A. KOTZIG: Regularly k-path connected graphs, Congressus Numerantium 40 (1983), 137-141.
249. A. KOSTOCHKA: The nonexistence of certain generalized friendship graphs, in: "Combinatorics" (Eger, 1987), Colloq. Math. Soc. János Bolyai 52, North-Holland, Amsterdam 1988, 341-356.
250. M. AJTAI, V. CHVÁTAL, M. NEWBORN & E. SZEMERÉDI: Crossing-free subgraphs, Annals of Discrete Math. 12 (1982), 9-12.
251. N. ALON & J. SPENCER: The Probabilistic Method, Third edition, Wiley-Interscience 2008.
252. D. CONLON: A new upper bound for diagonal Ramsey numbers, Annals Math. 170 (2009), 941-960.
253. P. ERDÖS: Some remarks on the theory of graphs, Bulletin Amer. Math. Soc. 53 (1947), 292-294.
254. P. ERDÖS: Graph theory and probability, Canadian J. Math. 11 (1959), 34-38.
255. P. ERDÖS: On a combinatorial problem I, Nordisk Math. Tidskrift 11 (1963), 5-10.
256. P. ERDÖS & R. K. GUY: Crossing number problems, Amer. Math. Monthly 80 (1973), 52-58.
257. P. ERDÖS & A. RÉNYI: On the evolution of random graphs, Magyar Tud. Akad. Mat. Kut. Int. Közl. 5 (1960), 17-61.
258. T. LEIGHTON: Complexity Issues in VLSI, MIT Press, Cambridge MA 1983.
259. J. RADHAKRISHNAN & A. SRINIVASAN: Improved bounds and algorithms for hypergraph 2-coloring, Random Struct. Algorithms 16 (2000), 4-32.
260. L. A. SZÉKELY: Crossing numbers and hard Erdös problems in discrete geometry, Combinatorics, Probability, and Computing 6 (1997), 353-358.