List of unsolved problems in mathematics

· Wikimedia Foundation, Inc. ·

65 min read Original article ↗

This is a dynamic list and may never be able to satisfy particular standards for completeness. You can help by editing the page to add missing items, with references to reliable sources.

Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory, group theory, mathematical logic, number theory, set theory, Ramsey theory, dynamical systems, and partial differential equations. Some problems belong to more than one discipline and are studied using techniques from different areas. Prizes are often awarded for the solution to a long-standing problem, and some lists of unsolved problems, such as the Millennium Prize Problems, receive considerable attention.

This list is a composite of notable unsolved problems mentioned in previously published lists, including but not limited to lists considered authoritative, and the problems listed here vary widely in both difficulty and importance.

For over a century, various mathematicians and organizations have published and promoted lists of unsolved mathematical problems. In some cases, the lists have been associated with prizes for the discoverers of solutions, with the Millennium Prize Problems each containing a reward of one million dollars.

ListNumber of
problems
Number unsolved
or incompletely solved
Proposed byProposed
in
Hilbert's problems[1]2313David Hilbert1900
Landau's problems[2]44Edmund Landau1912
Taniyama's problems[3]36Yutaka Taniyama1955
Thurston's 24 questions[4][5]242William Thurston1982
Smale's problems1814Stephen Smale1998
Millennium Prize Problems76[6]Clay Mathematics Institute2000
Simon problems1512[7][8]Barry Simon2000
DARPA's math challenges[9][10]23DARPA2007
Erdős's problems[11]> 1220634Paul ErdősOver six decades of Erdős' career, from the 1930s to 1990s
The Riemann zeta function, subject of the Riemann hypothesis[12]

Of the original seven Millennium Prize Problems listed by the Clay Mathematics Institute in 2000, six remain unsolved to date:[6]

The seventh problem, the Poincaré conjecture, was solved by Grigori Perelman in 2003.[13] However, a generalization called the smooth four-dimensional Poincaré conjecture—that is, whether a four-dimensional topological sphere can have two or more inequivalent smooth structures—is unsolved.[14]

In the Bloch sphere representation of a qubit, a SIC-POVM forms a regular tetrahedron. Zauner conjectured that analogous structures exist in complex Hilbert spaces of all finite dimensions.
The free Burnside group B ( 2 , 3 ) {\displaystyle B(2,3)} is finite; in its Cayley graph, shown here, each of its 27 elements is represented by a vertex. The question of which other groups B ( m , n ) {\displaystyle B(m,n)} are finite remains open.
A detail of the Mandelbrot set. It is not known whether the Mandelbrot set is locally connected or not.
In three dimensions, the kissing number is 12, because 12 non-overlapping unit spheres can be put into contact with a central unit sphere. (Here, the centers of outer spheres form the vertices of a regular icosahedron.) Kissing numbers are only known exactly in dimensions 1, 2, 3, 4, 8 and 24.
  • Are the two Meissner tetrahedra the minimum-volume three-dimensional shapes of constant width?[85]
An instance of the Erdős–Faber–Lovász conjecture: a graph formed from four cliques of four vertices each, any two of which intersect in a single vertex, can be four-colored.
  • Does there exist a conference graph for every number of vertices v > 1 {\displaystyle v>1} where v 1 mod 4 {\displaystyle v\equiv 1{\bmod {4}}} and v {\displaystyle v} is an odd sum of two squares?[120]
  • Conway's 99-graph problem: does there exist a strongly regular graph with parameters ( 99 , 14 , 1 , 2 ) {\displaystyle (99,14,1,2)} ?[121]
  • Degree diameter problem: given two positive integers d , k {\displaystyle d,k} , what is the largest graph of diameter k {\displaystyle k} such that all vertices have degrees at most d {\displaystyle d} ?
  • Jørgensen's conjecture that every 6-vertex-connected K 6 {\displaystyle K_{6}} -minor-free graph is an apex graph[122]
  • Does a Moore graph with girth 5 and degree 57 exist?[123]
  • Do there exist infinitely many strongly regular geodetic graphs, or any strongly regular geodetic graphs that are not Moore graphs?[124]
  • The Cherlin–Zilber conjecture: A simple group whose first-order theory is stable in 0 {\displaystyle \aleph _{0}} is a simple algebraic group over an algebraically closed field.
  • Generalized star height problem: can all regular languages be expressed using generalized regular expressions with limited nesting depths of Kleene stars?
  • For which number fields does Hilbert's tenth problem hold?
  • Kueker's conjecture[157]
  • The main gap conjecture, e.g. for uncountable first order theories, for AECs, and for 1 {\displaystyle \aleph _{1}} -saturated models of a countable theory.[158]
  • Shelah's categoricity conjecture for L ω 1 , ω {\displaystyle L_{\omega _{1},\omega }} : If a sentence is categorical above the Hanf number then it is categorical in all cardinals above the Hanf number.[158]
  • Shelah's eventual categoricity conjecture: For every cardinal λ {\displaystyle \lambda } there exists a cardinal μ ( λ ) {\displaystyle \mu (\lambda )} such that if an AEC K with LS(K) λ {\displaystyle {}\leq \lambda } is categorical in a cardinal above μ ( λ ) {\displaystyle \mu (\lambda )} then it is categorical in all cardinals above μ ( λ ) {\displaystyle \mu (\lambda )} .[158][159]
  • The stable field conjecture: every infinite field with a stable first-order theory is separably closed.
  • The stable forking conjecture for simple theories[160]
  • Tarski's exponential function problem: is the theory of the real numbers with the exponential function decidable?
  • The universality problem for C-free graphs: For which finite sets C of graphs does the class of C-free countable graphs have a universal member under strong embeddings?[161]
  • The universality spectrum problem: Is there a first-order theory whose universality spectrum is minimum?[162]
  • Vaught conjecture: the number of countable models of a first-order complete theory in a countable language is either finite, 0 {\displaystyle \aleph _{0}} , or 2 0 {\displaystyle 2^{\aleph _{0}}} .
  • Assume K is the class of models of a countable first order theory omitting countably many types. If K has a model of cardinality ω 1 {\displaystyle \aleph _{\omega _{1}}} does it have a model of cardinality continuum?[163]
  • Do the Henson graphs have the finite model property?
  • Does a finitely presented homogeneous structure for a finite relational language have finitely many reducts?
  • Does there exist an o-minimal first order theory with a trans-exponential (rapid growth) function?
  • If the class of atomic models of a complete first order theory is categorical in the n {\displaystyle \aleph _{n}} , is it categorical in every cardinal?[164][165]
  • Is every infinite, minimal field of characteristic zero algebraically closed? (Here, "minimal" means that every definable subset of the structure is finite or co-finite.)
  • Is the Borel monadic theory of the real order (BMTO) decidable? Is the monadic theory of well-ordering (MTWO) consistently decidable?[166]
  • Is the theory of the field of Laurent series over Z p {\displaystyle \mathbb {Z} _{p}} decidable? of the field of polynomials over C {\displaystyle \mathbb {C} } ?
  • Is there a logic L which satisfies both the Beth property and Δ-interpolation, is compact but does not satisfy the interpolation property?[167]
  • Determine the structure of Keisler's order.[168][169]
  • What is the nature of the proof-theoretic ordinal (the smallest ordinal a theory cannot prove well-founded) for second-order arithmetic, ZFC, or stronger theories?[170]
6 is a perfect number because it is the sum of its proper positive divisors, 1, 2 and 3. It is not known how many perfect numbers there are, nor if any of them is odd.

Diophantine approximation and transcendental number theory

[edit source]

The area of the blue region converges to the Euler–Mascheroni constant, which may or may not be a rational number.
Goldbach's conjecture states that all even integers greater than 2 can be written as the sum of two primes. Here this is illustrated for the even integers from 4 to 28.

The following conjectures are expressed in the first-order language of axiomatic set theory and, unless stated otherwise, are here taken to be over Zermelo-Frankel set theory, possibly with Choice. In particular, the conjecture's independence may not be open in set theories with a wider or conflicting class of models, such as the various constructive resp. non-wellfounded set theories, etc.

The unknotting problem asks whether there is an efficient algorithm to identify when the shape presented in a knot diagram is actually the unknot.
The Einstein problem asks whether aperiodic monotiles, like the Tile(1,1) pictured here, exist.
  1. A counterexample has been announced, with a preprint made available on arXiv.[92]
  2. A disproof has been announced, with a preprint made available on arXiv.[189]
  1. Thiele, Rüdiger (2005). "On Hilbert and his twenty-four problems". In Van Brummelen, Glen (ed.). Mathematics and the historian's craft. The Kenneth O. May Lectures. CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC. Vol. 21. pp. 243–295. ISBN 978-0-387-25284-1.
  2. Guy, Richard (1994). Unsolved Problems in Number Theory (2nd ed.). Springer. p. vii. ISBN 978-1-4899-3585-4. Archived from the original on 2019-03-23. Retrieved 2016-09-22..
  3. Shimura, G. (1989). "Yutaka Taniyama and his time". Bulletin of the London Mathematical Society. 21 (2): 186–196. doi:10.1112/blms/21.2.186.
  4. Friedl, Stefan (2014). "Thurston's vision and the virtual fibering theorem for 3-manifolds". Jahresbericht der Deutschen Mathematiker-Vereinigung. 116 (4): 223–241. doi:10.1365/s13291-014-0102-x. MR 3280572. S2CID 56322745.
  5. Thurston, William P. (1982). "Three-dimensional manifolds, Kleinian groups and hyperbolic geometry". Bulletin of the American Mathematical Society. New Series. 6 (3): 357–381. doi:10.1090/S0273-0979-1982-15003-0. MR 0648524.
  6. 1 2 "Millennium Problems". claymath.org. Archived from the original on 2017-06-06. Retrieved 2015-01-20.
  7. "Fields Medal awarded to Artur Avila". Centre national de la recherche scientifique. 2014-08-13. Archived from the original on 2018-07-10. Retrieved 2018-07-07.
  8. Bellos, Alex (2014-08-13). "Fields Medals 2014: the maths of Avila, Bhargava, Hairer and Mirzakhani explained". The Guardian. Archived from the original on 2016-10-21. Retrieved 2018-07-07.
  9. "DARPA invests in math". CNN. 2008-10-14. Archived from the original on 2009-03-04. Retrieved 2013-01-14.
  10. "Broad Agency Announcement (BAA 07-68) for Defense Sciences Office (DSO)". DARPA. 2007-09-10. Archived from the original on 2012-10-01. Retrieved 2013-06-25.
  11. Bloom, Thomas. "Erdős Problems". Retrieved 2026-05-09.
  12. "Math Problems Guide: From Simple to Hardest Math Problems Tips & Examples". blendedlearningmath. Retrieved 2024-11-28.
  13. "Poincaré Conjecture". Clay Mathematics Institute. Archived from the original on 2013-12-15.
  14. rybu (November 7, 2009). "Smooth 4-dimensional Poincare conjecture". Open Problem Garden. Archived from the original on 2018-01-25. Retrieved 2019-08-06.
  15. Khukhro, Evgeny I.; Mazurov, Victor D. (2019). Unsolved Problems in Group Theory. The Kourovka Notebook. arXiv:1401.0300v16.
  16. RSFSR, MV i SSO; Russie), Uralʹskij gosudarstvennyj universitet im A. M. Gorʹkogo (Ekaterinbourg (1969). Свердловская тетрадь: нерешенные задачи теории подгрупп (in Russian). S. l.
  17. Свердловская тетрадь: Сб. нерешённых задач по теории полугрупп. Свердловск: Уральский государственный университет. 1979.
  18. Свердловская тетрадь: Сб. нерешённых задач по теории полугрупп. Свердловск: Уральский государственный университет. 1989.
  19. ДНЕСТРОВСКАЯ ТЕТРАДЬ [DNIESTER NOTEBOOK] (PDF) (in Russian). The Russian Academy of Sciences. 1993.
  20. "DNIESTER NOTEBOOK: Unsolved Problems in the Theory of Rings and Modules" (PDF). University of Saskatchewan. Retrieved 2019-08-15.
  21. Эрлагольская тетрадь [Erlagol notebook] (PDF) (in Russian). The Novosibirsk State University. 2018.
  22. Dowling, T. A. (February 1973). "A class of geometric lattices based on finite groups". Journal of Combinatorial Theory. Series B. 14 (1): 61–86. doi:10.1016/S0095-8956(73)80007-3.
  23. Schmidt, Kai-Uwe; Willms, Jürgen (2016). "Barker sequences of odd length". Designs, Codes and Cryptography. 80 (2): 409–414. doi:10.1007/s10623-015-0104-4.
  24. Aschbacher, Michael (1990). "On Conjectures of Guralnick and Thompson". Journal of Algebra. 135 (2): 277–343. doi:10.1016/0021-8693(90)90292-V.
  25. Kung, H. T.; Traub, Joseph Frederick (1974). "Optimal order of one-point and multipoint iteration". Journal of the ACM. 21 (4): 643–651. doi:10.1145/321850.321860. S2CID 74921.
  26. Smyth, Chris (2008). "The Mahler measure of algebraic numbers: a survey". In McKee, James; Smyth, Chris (eds.). Number Theory and Polynomials. London Mathematical Society Lecture Note Series. Vol. 352. Cambridge University Press. pp. 322–349. ISBN 978-0-521-71467-9.
  27. Berenstein, Carlos A. (2001) [1994]. "Pompeiu problem". Encyclopedia of Mathematics. EMS Press.
  28. Csordas, George; Smith, Wayne; Varga, Richard S. (1994). "Lehmer pairs of zeros, the de Bruijn-Newman constant Λ, and the Riemann hypothesis". Constructive Approximation. 10 (1): 107–129. doi:10.1007/BF01205170. MR 1260363. S2CID 122664556.
  29. Brightwell, Graham R.; Felsner, Stefan; Trotter, William T. (1995). "Balancing pairs and the cross product conjecture". Order. 12 (4): 327–349. doi:10.1007/BF01110378. MR 1368815. S2CID 14793475..
  30. Tao, Terence (2018). "Some remarks on the lonely runner conjecture". Contributions to Discrete Mathematics. 13 (2): 1–31. arXiv:1701.02048. doi:10.11575/cdm.v13i2.62728.
  31. González-Jiménez, Enrique; Xarles, Xavier (2014). "On a conjecture of Rudin on squares in arithmetic progressions". LMS Journal of Computation and Mathematics. 17 (1): 58–76. arXiv:1301.5122. doi:10.1112/S1461157013000259. S2CID 11615385.
  32. Bruhn, Henning; Schaudt, Oliver (2015). "The journey of the union-closed sets conjecture" (PDF). Graphs and Combinatorics. 31 (6): 2043–2074. arXiv:1309.3297. doi:10.1007/s00373-014-1515-0. MR 3417215. S2CID 17531822. Archived (PDF) from the original on 2017-08-08. Retrieved 2017-07-18.
  33. Murnaghan, F. D. (1938). "The Analysis of the Direct Product of Irreducible Representations of the Symmetric Groups". American Journal of Mathematics. 60 (1): 44–65. doi:10.2307/2371542. JSTOR 2371542. MR 1507301. PMC 1076971. PMID 16577800.
  34. "Dedekind Numbers and Related Sequences" (PDF). Archived from the original (PDF) on 2015-03-15. Retrieved 2020-04-30.
  35. Liśkiewicz, Maciej; Ogihara, Mitsunori; Toda, Seinosuke (2003-07-28). "The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes". Theoretical Computer Science. 304 (1): 129–156. doi:10.1016/S0304-3975(03)00080-X. S2CID 33806100.
  36. S. M. Ulam, Problems in Modern Mathematics. Science Editions John Wiley & Sons, Inc., New York, 1964, page 76.
  37. Kaloshin, Vadim; Sorrentino, Alfonso (2018). "On the local Birkhoff conjecture for convex billiards". Annals of Mathematics. 188 (1): 315–380. arXiv:1612.09194. doi:10.4007/annals.2018.188.1.6. S2CID 119171182.
  38. Sarnak, Peter (2011). "Recent progress on the quantum unique ergodicity conjecture". Bulletin of the American Mathematical Society. 48 (2): 211–228. doi:10.1090/S0273-0979-2011-01323-4. MR 2774090.
  39. Paul Halmos, Ergodic theory. Chelsea, New York, 1956.
  40. Bowman, Joshua (2015). "The way the billiard ball bounces". Math Horizons. 22 (3): 18–22. doi:10.4169/mathhorizons.22.3.18. JSTOR 10.4169/mathhorizons.22.3.18. MR 3313808.
  41. Kari, Jarkko (2009). "Structure of reversible cellular automata". Structure of Reversible Cellular Automata. International Conference on Unconventional Computation. Lecture Notes in Computer Science. Vol. 5715. Springer. p. 6. Bibcode:2009LNCS.5715....6K. doi:10.1007/978-3-642-03745-0_5. ISBN 978-3-642-03744-3.
  42. 1 2 3 "Open Q – Solving and rating of hard Sudoku". english.log-it-ex.com. Archived from the original on 10 November 2017.
  43. "Higher-Dimensional Tic-Tac-Toe". PBS Infinite Series. YouTube. 2017-09-21. Archived from the original on 2017-10-11. Retrieved 2018-07-29.
  44. Austin, David (August 2016). "Game. SET. Polynomial". Feature column. American Mathematical Society..
  45. Barlet, Daniel; Peternell, Thomas; Schneider, Michael (1990). "On two conjectures of Hartshorne's". Mathematische Annalen. 286 (1–3): 13–25. doi:10.1007/BF01453563. S2CID 122151259.
  46. Dupont, Johan L. (2001). Scissors congruences, group homology and characteristic classes. Nankai Tracts in Mathematics. Vol. 1. World Scientific Publishing Co., Inc., River Edge, NJ. p. 6. doi:10.1142/9789812810335. ISBN 978-981-02-4507-8. MR 1832859. Archived from the original on 2016-04-29..
  47. Maulik, Davesh; Nekrasov, Nikita; Okounov, Andrei; Pandharipande, Rahul (2004-06-05). Gromov–Witten theory and Donaldson–Thomas theory, I. arXiv:math/0312059. Bibcode:2003math.....12059M.
  48. Zariski, Oscar (1971). "Some open questions in the theory of singularities". Bulletin of the American Mathematical Society. 77 (4): 481–491. doi:10.1090/S0002-9904-1971-12729-5. MR 0277533.
  49. Bereg, Sergey; Dumitrescu, Adrian; Jiang, Minghui (2010). "On covering problems of Rado". Algorithmica. 57 (3): 538–561. doi:10.1007/s00453-009-9298-z. MR 2609053. S2CID 6511998.
  50. Melissen, Hans (1993). "Densest packings of congruent circles in an equilateral triangle". American Mathematical Monthly. 100 (10): 916–925. doi:10.2307/2324212. JSTOR 2324212. MR 1252928.
  51. Conway, John H.; Neil J.A. Sloane (1999). Sphere Packings, Lattices and Groups (3rd ed.). New York: Springer-Verlag. pp. 21–22. ISBN 978-0-387-98585-5.
  52. Hales, Thomas (2017). The Reinhardt conjecture as an optimal control problem. arXiv:1703.01352.
  53. Brass, Peter; Moser, William; Pach, János (2005). Research Problems in Discrete Geometry. New York: Springer. p. 45. ISBN 978-0387-23815-9. MR 2163782.
  54. Gardner, Martin (1995). New Mathematical Diversions (Revised Edition). Washington: Mathematical Association of America. p. 251.
  55. Musin, Oleg R.; Tarasov, Alexey S. (2015). "The Tammes Problem for N = 14". Experimental Mathematics. 24 (4): 460–468. doi:10.1080/10586458.2015.1022842. S2CID 39429109.
  56. Barros, Manuel (1997). "General Helices and a Theorem of Lancret". Proceedings of the American Mathematical Society. 125 (5): 1503–1509. doi:10.1090/S0002-9939-97-03692-7. JSTOR 2162098.
  57. Katz, Mikhail G. (2007). Systolic geometry and topology. Mathematical Surveys and Monographs. Vol. 137. American Mathematical Society, Providence, RI. p. 57. doi:10.1090/surv/137. ISBN 978-0-8218-4177-8. MR 2292367.
  58. Rosenberg, Steven (1997). The Laplacian on a Riemannian Manifold: An introduction to analysis on manifolds. London Mathematical Society Student Texts. Vol. 31. Cambridge: Cambridge University Press. pp. 62–63. doi:10.1017/CBO9780511623783. ISBN 978-0-521-46300-3. MR 1462892.
  59. Nikolayevsky, Y. (2003). "Two theorems on Osserman manifolds". Differential Geometry and Its Applications. 18 (3): 239–253. doi:10.1016/S0926-2245(02)00160-2.
  60. Ghosh, Subir Kumar; Goswami, Partha P. (2013). "Unsolved problems in visibility graphs of points, segments, and polygons". ACM Computing Surveys. 46 (2): 22:1–22:29. arXiv:1012.5187. doi:10.1145/2543581.2543589. S2CID 8747335.
  61. Brass, Peter; Moser, William; Pach, János (2005). Research problems in discrete geometry. Berlin: Springer. ISBN 0-387-23815-8.
  62. Boltjansky, V.; Gohberg, I. (1985). "11. Hadwiger's Conjecture". Results and Problems in Combinatorial Geometry. Cambridge University Press. pp. 44–46..
  63. Morris, Walter D.; Soltan, Valeriu (2000). "The Erdős-Szekeres problem on points in convex position—a survey". Bull. Amer. Math. Soc. 37 (4): 437–458. doi:10.1090/S0273-0979-00-00877-6. MR 1779413.; Suk, Andrew (2016). "On the Erdős–Szekeres convex polygon problem". J. Amer. Math. Soc. 30 (4): 1047–1053. arXiv:1604.08657. doi:10.1090/jams/869. S2CID 15732134.
  64. Kalai, Gil (1989). "The number of faces of centrally-symmetric polytopes". Graphs and Combinatorics. 5 (1): 389–391. doi:10.1007/BF01788696. MR 1554357. S2CID 8917264..
  65. Moreno, José Pedro; Prieto-Martínez, Luis Felipe (2021). "El problema de los triángulos de Kobon" [The Kobon triangles problem]. La Gaceta de la Real Sociedad Matemática Española (in Spanish). 24 (1): 111–130. hdl:10486/705416. MR 4225268.
  66. Guy, Richard K. (1983). "An olla-podrida of open problems, often oddly posed". American Mathematical Monthly. 90 (3): 196–200. doi:10.2307/2975549. JSTOR 2975549. MR 1540158.
  67. Matoušek, Jiří (2002). Lectures on discrete geometry. Graduate Texts in Mathematics. Vol. 212. Springer-Verlag, New York. p. 206. doi:10.1007/978-1-4613-0039-7. ISBN 978-0-387-95373-1. MR 1899299.
  68. Burr, S. A.; Grünbaum, B.; Sloane, N. J. A. (1974). "The Orchard problem". Geometriae Dedicata. 2 (4): 397–424. doi:10.1007/BF00147569. S2CID 120906839.
  69. Brass, Peter; Moser, William; Pach, János (2005). "5.1 The Maximum Number of Unit Distances in the Plane". Research problems in discrete geometry. Springer, New York. pp. 183–190. ISBN 978-0-387-23815-9. MR 2163782.
  70. Dey, Tamal K. (1998). "Improved bounds for planar k-sets and related problems". Discrete & Computational Geometry. 19 (3): 373–382. doi:10.1007/PL00009354. MR 1608878.; Tóth, Gábor (2001). "Point sets with many k-sets". Discrete & Computational Geometry. 26 (2): 187–194. doi:10.1007/s004540010022. MR 1843435..
  71. Aichholzer, Oswin; García, Jesús; Orden, David; Ramos, Pedro (2007). "New Lower Bounds for the Number of (≤ k)-Edges and the Rectilinear Crossing Number of Kn" (PDF). Discrete & Computational Geometry. 38 (1): 1–14. doi:10.1007/s00454-007-1325-8. Retrieved 22 July 2025.
  72. Aronov, Boris; Dujmović, Vida; Morin, Pat; Ooms, Aurélien; Schultz Xavier da Silveira, Luís Fernando (2019). "More Turán-type theorems for triangles in convex point sets". Electronic Journal of Combinatorics. 26 (1): 1.8. arXiv:1706.10193. Bibcode:2017arXiv170610193A. doi:10.37236/7224. Archived from the original on 2019-02-18. Retrieved 2019-02-18.
  73. Atiyah, Michael (2001). "Configurations of points". Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences. 359 (1784): 1375–1387. Bibcode:2001RSPTA.359.1375A. doi:10.1098/rsta.2001.0840. ISSN 1364-503X. MR 1853626. S2CID 55833332.
  74. Finch, S. R.; Wetzel, J. E. (2004). "Lost in a forest". American Mathematical Monthly. 11 (8): 645–654. doi:10.2307/4145038. JSTOR 4145038. MR 2091541.
  75. Howards, Hugh Nelson (2013). "Forming the Borromean rings out of arbitrary polygonal unknots". Journal of Knot Theory and Its Ramifications. 22 (14): 1350083, 15. arXiv:1406.3370. doi:10.1142/S0218216513500831. MR 3190121. S2CID 119674622.
  76. Miller, Ezra; Pak, Igor (2008). "Metric combinatorics of convex polyhedra: Cut loci and nonoverlapping unfoldings". Discrete & Computational Geometry. 39 (1–3): 339–388. doi:10.1007/s00454-008-9052-3. MR 2383765.. Announced in 2003.
  77. Solomon, Yaar; Weiss, Barak (2016). "Dense forests and Danzer sets". Annales Scientifiques de l'École Normale Supérieure. 49 (5): 1053–1074. arXiv:1406.3807. doi:10.24033/asens.2303. MR 3581810. S2CID 672315.; Conway, John H. Five $1,000 Problems (Update 2017) (PDF). On-Line Encyclopedia of Integer Sequences. Archived (PDF) from the original on 2019-02-13. Retrieved 2019-02-12.
  78. Brandts, Jan; Korotov, Sergey; Křížek, Michal; Šolc, Jakub (2009). "On nonobtuse simplicial partitions" (PDF). SIAM Review. 51 (2): 317–335. Bibcode:2009SIAMR..51..317B. doi:10.1137/060669073. MR 2505583. S2CID 216078793. Archived (PDF) from the original on 2018-11-04. Retrieved 2018-11-22.. See in particular Conjecture 23, p. 327.
  79. Arutyunyants, G.; Iosevich, A. (2004). "Falconer conjecture, spherical averages and discrete analogs". In Pach, János (ed.). Towards a Theory of Geometric Graphs. Contemp. Math. Vol. 342. Amer. Math. Soc., Providence, RI. pp. 15–24. doi:10.1090/conm/342/06127. ISBN 978-0-8218-3484-8. MR 2065249.
  80. Matschke, Benjamin (2014). "A survey on the square peg problem". Notices of the American Mathematical Society. 61 (4): 346–352. doi:10.1090/noti1100.
  81. Katz, Nets; Tao, Terence (2002). "Recent progress on the Kakeya conjecture". Proceedings of the 6th International Conference on Harmonic Analysis and Partial Differential Equations (El Escorial, 2000). Publicacions Matemàtiques. pp. 161–179. doi:10.5565/PUBLMAT_Esco02_07. MR 1964819. S2CID 77088.
  82. Weaire, Denis, ed. (1997). The Kelvin Problem. CRC Press. p. 1. ISBN 978-0-7484-0632-6.
  83. Brass, Peter; Moser, William; Pach, János (2005). Research problems in discrete geometry. New York: Springer. p. 457. ISBN 978-0-387-29929-7. MR 2163782.
  84. Mahler, Kurt (1939). "Ein Minimalproblem für konvexe Polygone". Mathematica (Zutphen) B: 118–127.
  85. Kawohl, Bernd; Weber, Christof (2011). "Meissner's Mysterious Bodies" (PDF). Mathematical Intelligencer. 33 (3): 94–101. doi:10.1007/s00283-011-9239-y. S2CID 120570093..
  86. Norwood, Rick; Poole, George; Laidacker, Michael (1992). "The worm problem of Leo Moser". Discrete & Computational Geometry. 7 (2): 153–162. doi:10.1007/BF02187832. MR 1139077.
  87. Wagner, Neal R. (1976). "The Sofa Problem" (PDF). The American Mathematical Monthly. 83 (3): 188–189. doi:10.2307/2977022. JSTOR 2977022. Archived (PDF) from the original on 2015-04-20. Retrieved 2014-05-14.
  88. Senechal, Marjorie; Galiulin, R. V. (1984). "An introduction to the theory of figures: the geometry of E. S. Fedorov". Structural Topology (in English and French) (10): 5–22. hdl:2099/1195. MR 0768703.
  89. Grünbaum, Branko; Shephard, G. C. (1980). "Tilings with congruent tiles". Bulletin of the American Mathematical Society. New Series. 3 (3): 951–973. doi:10.1090/S0273-0979-1980-14827-2. MR 0585178.
  90. Chai, Ying; Yuan, Liping; Zamfirescu, Tudor (June–July 2018). "Rupert Property of Archimedean Solids". The American Mathematical Monthly. 125 (6): 497–504. doi:10.1080/00029890.2018.1449505. S2CID 125508192.
  91. Steininger, Jakob; Yurkevich, Sergey (December 27, 2021). An algorithmic approach to Rupert's problem. arXiv:2112.13754.
  92. Steininger, Jakob; Yurkevich, Sergey (2025). A convex polyhedron without Rupert's property. arXiv:2508.18475.
  93. Demaine, Erik D.; O'Rourke, Joseph (2007). "Chapter 22. Edge Unfolding of Polyhedra". Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press. pp. 306–338.
  94. Ghomi, Mohammad (2018-01-01). "Dürer's Unfolding Problem for Convex Polyhedra". Notices of the American Mathematical Society. 65 (1): 25–27. doi:10.1090/noti1609. ISSN 0002-9920.
  95. Whyte, L. L. (1952). "Unique arrangements of points on a sphere". The American Mathematical Monthly. 59 (9): 606–611. doi:10.2307/2306764. JSTOR 2306764. MR 0050303.
  96. ACW (May 24, 2012). "Convex uniform 5-polytopes". Open Problem Garden. Archived from the original on October 5, 2016. Retrieved 2016-10-04..
  97. Klostermeyer, W.; Mynhardt, C. (2015). "Protecting a graph with mobile guards". Applicable Analysis and Discrete Mathematics. 10: 21. arXiv:1407.5228. doi:10.2298/aadm151109021k.
  98. MacGillivray, Gary; Mynhardt, C. M.; Virgile, Virgélot (2022). "Eternal domination and clique covering". Electronic Journal of Graph Theory and Applications. 10 (2): 603–624. doi:10.5614/ejgta.2022.10.2.19.
  99. Pleanmani, Nopparat (2019). "Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph". Discrete Mathematics, Algorithms and Applications. 11 (6): 1950068, 7. doi:10.1142/s179383091950068x. MR 4044549. S2CID 204207428.
  100. Baird, William; Bonato, Anthony (2012). "Meyniel's conjecture on the cop number: a survey". Journal of Combinatorics. 3 (2): 225–238. arXiv:1308.3385. doi:10.4310/JOC.2012.v3.n2.a6. MR 2980752. S2CID 18942362.
  101. Zhu, Xuding (1999). "The Game Coloring Number of Planar Graphs". Journal of Combinatorial Theory, Series B. 75 (2): 245–258. doi:10.1006/jctb.1998.1878.
  102. Bousquet, Nicolas; Bartier, Valentin (2019). "Linear Transformations Between Colorings in Chordal Graphs". In Bender, Michael A.; Svensson, Ola; Herman, Grzegorz (eds.). 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany. LIPIcs. Vol. 144. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. pp. 24:1–24:15. doi:10.4230/LIPIcs.ESA.2019.24. ISBN 978-3-95977-124-5. S2CID 195791634.
  103. Gethner, Ellen (2018). "To the Moon and beyond". In Gera, Ralucca; Haynes, Teresa W.; Hedetniemi, Stephen T. (eds.). Graph Theory: Favorite Conjectures and Open Problems, II. Problem Books in Mathematics. Springer International Publishing. pp. 115–133. doi:10.1007/978-3-319-97686-0_11. ISBN 978-3-319-97684-6. MR 3930641.
  104. Chung, Fan; Graham, Ron (1998). Erdős on Graphs: His Legacy of Unsolved Problems. A K Peters. pp. 97–99..
  105. Chudnovsky, Maria; Seymour, Paul (2014). "Extending the Gyárfás-Sumner conjecture". Journal of Combinatorial Theory. Series B. 105: 11–16. doi:10.1016/j.jctb.2013.11.002. MR 3171779.
  106. Toft, Bjarne (1996). "A survey of Hadwiger's conjecture". Congressus Numerantium. 115: 249–283. MR 1411244..
  107. Croft, Hallard T.; Falconer, Kenneth J.; Guy, Richard K. (1991). Unsolved Problems in Geometry. Springer-Verlag., Problem G10.
  108. Hägglund, Jonas; Steffen, Eckhard (2014). "Petersen-colorings and some families of snarks". Ars Mathematica Contemporanea. 7 (1): 161–173. doi:10.26493/1855-3974.288.11a. MR 3047618. Archived from the original on 2016-10-03. Retrieved 2016-09-30..
  109. Jensen, Tommy R.; Toft, Bjarne (1995). "12.20 List-Edge-Chromatic Numbers". Graph Coloring Problems. New York: Wiley-Interscience. pp. 201–202. ISBN 978-0-471-02865-9..
  110. Molloy, Michael; Reed, Bruce (1998). "A bound on the total chromatic number". Combinatorica. 18 (2): 241–280. doi:10.1007/PL00009820. hdl:1807/9465. MR 1656544. S2CID 9600550..
  111. Barát, János; Tóth, Géza (2010). "Towards the Albertson Conjecture". Electronic Journal of Combinatorics. 17 (1): R73. arXiv:0909.0413. Bibcode:2009arXiv0909.0413B. doi:10.37236/345..
  112. Fulek, Radoslav; Pach, János (2011). "A computational approach to Conway's thrackle conjecture". Computational Geometry. 44 (6–7): 345–355. arXiv:1002.3904. doi:10.1016/j.comgeo.2011.02.001. MR 2785903..
  113. Gupta, Anupam; Newman, Ilan; Rabinovich, Yuri; Sinclair, Alistair (2004). "Cuts, trees and 1 {\displaystyle \ell _{1}} -embeddings of graphs". Combinatorica. 24 (2): 233–269. doi:10.1007/s00493-004-0015-x. MR 2071334. S2CID 46133408.
  114. Hartsfield, Nora; Ringel, Gerhard (2013). Pearls in Graph Theory: A Comprehensive Introduction. Dover Books on Mathematics. Courier Dover Publications. p. 247. ISBN 978-0-486-31552-2. MR 2047103..
  115. Hliněný, Petr (2010). "20 years of Negami's planar cover conjecture" (PDF). Graphs and Combinatorics. 26 (4): 525–536. doi:10.1007/s00373-010-0934-9. MR 2669457. S2CID 121645. Archived (PDF) from the original on 2016-03-04. Retrieved 2016-10-04..
  116. Nöllenburg, Martin; Prutkin, Roman; Rutter, Ignaz (2016). "On self-approaching and increasing-chord drawings of 3-connected planar graphs". Journal of Computational Geometry. 7 (1): 47–69. arXiv:1409.0315. doi:10.20382/jocg.v7i1a3. MR 3463906. S2CID 1500695.
  117. Pach, János; Sharir, Micha (2009). "5.1 Crossings—the Brick Factory Problem". Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures. Mathematical Surveys and Monographs. Vol. 152. American Mathematical Society. pp. 126–127..
  118. Guy, R. K. (1960). "A combinatorial problem". Nabla (Bulletin of the Malayan Mathematical Society). 7: 68–72.
  119. Demaine, E.; O'Rourke, J. (2002–2012). "Problem 45: Smallest Universal Set of Points for Planar Graphs". The Open Problems Project. Archived from the original on 2012-08-14. Retrieved 2013-03-19..
  120. Brouwer, Andries E.; Van Maldeghem, Hendrik (2022). "8.2 Conference matrices and conference graphs". Strongly regular graphs (PDF). New Mathematical Monographs. Vol. 41. American Mathematical Society. pp. 189–190. ISBN 978-1-316-51203-6.
  121. Conway, John H. Five $1,000 Problems (Update 2017) (PDF). Online Encyclopedia of Integer Sequences. Archived (PDF) from the original on 2019-02-13. Retrieved 2019-02-12.
  122. mdevos; Wood, David (December 7, 2019). "Jorgensen's Conjecture". Open Problem Garden. Archived from the original on 2016-11-14. Retrieved 2016-11-13..
  123. Ducey, Joshua E. (2017). "On the critical group of the missing Moore graph". Discrete Mathematics. 340 (5): 1104–1109. arXiv:1509.00327. doi:10.1016/j.disc.2016.10.001. MR 3612450. S2CID 28297244.
  124. Blokhuis, A.; Brouwer, A. E. (1988). "Geodetic graphs of diameter two". Geometriae Dedicata. 25 (1–3): 527–533. doi:10.1007/BF00191941. MR 0925851. S2CID 189890651.
  125. Florek, Jan (2010). "On Barnette's conjecture". Discrete Mathematics. 310 (10–11): 1531–1535. doi:10.1016/j.disc.2010.01.018. MR 2601261..
  126. Broersma, Hajo; Patel, Viresh; Pyatkin, Artem (2014). "On toughness and Hamiltonicity of 2 K 2 {\displaystyle 2K_{2}} -free graphs" (PDF). Journal of Graph Theory. 75 (3): 244–255. doi:10.1002/jgt.21734. MR 3153119. S2CID 1377980.
  127. Jaeger, F. (1985). "A survey of the cycle double cover conjecture". Annals of Discrete Mathematics 27 – Cycles in Graphs. North-Holland Mathematics Studies. Vol. 27. pp. 1–12. doi:10.1016/S0304-0208(08)72993-1. ISBN 978-0-444-87803-8..
  128. Heckman, Christopher Carl; Krakovski, Roi (2013). "Erdös-Gyárfás conjecture for cubic planar graphs". Electronic Journal of Combinatorics. 20 (2). P7. doi:10.37236/3252..
  129. Chudnovsky, Maria (2014). "The Erdös–Hajnal conjecture—a survey" (PDF). Journal of Graph Theory. 75 (2): 178–190. arXiv:1606.08827. doi:10.1002/jgt.21730. MR 3150572. S2CID 985458. Zbl 1280.05086. Archived (PDF) from the original on 2016-03-04. Retrieved 2016-09-22..
  130. Kawarabayashi, Ken-ichi; Niu, Jianbing; Zhang, Cun-Quan (2007). "Chords of longest circuits in locally planar graphs". European Journal of Combinatorics. 28 (1): 315–321. doi:10.1016/j.ejc.2005.07.017. MR 2261821.
  131. Akiyama, Jin; Exoo, Geoffrey; Harary, Frank (1981). "Covering and packing in graphs. IV. Linear arboricity". Networks. 11 (1): 69–72. doi:10.1002/net.3230110108. MR 0608921..
  132. Babai, László (June 9, 1994). "Automorphism groups, isomorphism, reconstruction". Handbook of Combinatorics. Archived from the original (PostScript) on 13 June 2007.
  133. Lenz, Hanfried; Ringel, Gerhard (1991). "A brief review on Egmont Köhler's mathematical work". Discrete Mathematics. 97 (1–3): 3–16. doi:10.1016/0012-365X(91)90416-Y. MR 1140782.
  134. Fomin, Fedor V.; Høie, Kjartan (2006). "Pathwidth of cubic graphs and exact algorithms". Information Processing Letters. 97 (5): 191–196. doi:10.1016/j.ipl.2005.10.012. MR 2195217.
  135. Schwenk, Allen (2012). Some History on the Reconstruction Conjecture (PDF). Joint Mathematics Meetings. Archived from the original (PDF) on 2015-04-09. Retrieved 2018-11-26.
  136. Ramachandran, S. (1981). "On a new digraph reconstruction conjecture". Journal of Combinatorial Theory. Series B. 31 (2): 143–149. doi:10.1016/S0095-8956(81)80019-6. MR 0630977.
  137. Kühn, Daniela; Mycroft, Richard; Osthus, Deryk (2011). "A proof of Sumner's universal tournament conjecture for large tournaments". Proceedings of the London Mathematical Society. Third Series. 102 (4): 731–766. arXiv:1010.4430. doi:10.1112/plms/pdq035. MR 2793448. S2CID 119169562. Zbl 1218.05034..
  138. Tuza, Zsolt (1990). "A conjecture on triangles of graphs". Graphs and Combinatorics. 6 (4): 373–380. doi:10.1007/BF01787705. MR 1092587. S2CID 38821128.
  139. DeVos, Matthew (October 22, 2007). "Unfriendly partitions". Open problem garden.
  140. Brešar, Boštjan; Dorbec, Paul; Goddard, Wayne; Hartnell, Bert L.; Henning, Michael A.; Klavžar, Sandi; Rall, Douglas F. (2012). "Vizing's conjecture: a survey and recent results". Journal of Graph Theory. 69 (1): 46–76. doi:10.1002/jgt.20565. MR 2864622. S2CID 9120720..
  141. Bailey, R. F.; Stevens, B. (2010). "Hamiltonian decompositions of complete $k$-uniform hypergraphs". Discrete Mathematics. 310 (22): 3088–3095. doi:10.1016/j.disc.2009.03.047. ISSN 0012-365X.
  142. 1 2 3 4 5 Kitaev, Sergey; Lozin, Vadim (2015). Words and Graphs. Monographs in Theoretical Computer Science. An EATCS Series. doi:10.1007/978-3-319-25859-1. ISBN 978-3-319-25857-7. S2CID 7727433 via link.springer.com.
  143. 1 2 3 4 5 Kitaev, Sergey (2017-05-16). A Comprehensive Introduction to the Theory of Word-Representable Graphs. International Conference on Developments in Language Theory. arXiv:1705.05924v1. doi:10.1007/978-3-319-62809-7_2.
  144. 1 2 3 4 5 Kitaev, S. V.; Pyatkin, A. V. (April 1, 2018). "Word-Representable Graphs: a Survey". Journal of Applied and Industrial Mathematics. 12 (2): 278–296. doi:10.1134/S1990478918020084. S2CID 125814097 via Springer Link.
  145. 1 2 3 4 5 Kitaev, Sergey V.; Pyatkin, Artem V. (2018). "Графы, представимые в виде слов. Обзор результатов" [Word-representable graphs: A survey]. Дискретн. Анализ И Исслед. Опер. (in Russian). 25 (2): 19–53. doi:10.17377/daio.2018.25.588.
  146. Marc Elliot Glen (2016). "Colourability and word-representability of near-triangulations". arXiv:1605.01688 [math.CO].
  147. Kitaev, Sergey (2014-03-06). "On graphs with representation number 3". arXiv:1403.1616v1 [math.CO].
  148. Glen, Marc; Kitaev, Sergey; Pyatkin, Artem (2018). "On the representation number of a crown graph". Discrete Applied Mathematics. 244: 89–93. arXiv:1609.00674. doi:10.1016/j.dam.2018.03.013. S2CID 46925617.
  149. Gurvich, V. (2011). "On exact blockers and anti-blockers, Δ {\displaystyle \Delta } -conjecture, and related problems". Discrete Applied Mathematics. 159 (5): 311–321. doi:10.1016/j.dam.2010.11.014.
  150. Andrade, Diogo V.; Boros, Endre; Gurvich, Vladimir (2018). Goldengorin, Boris (ed.). Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th Birthday. Springer Optimization and Its Applications 139. pp. 3–64.
  151. Kozerenko, Sergiy; Skochko, Volodymyr (2014). "On graphs with graphic imbalance sequences". Algebra and Discrete Mathematics. 18 (1): 97–108.
  152. Spinrad, Jeremy P. (2003). "2. Implicit graph representation". Efficient Graph Representations. American Mathematical Soc. pp. 17–30. ISBN 978-0-8218-2815-1..
  153. "Seymour's 2nd Neighborhood Conjecture". faculty.math.illinois.edu. Archived from the original on 11 January 2019. Retrieved 17 August 2022.
  154. Teschner, Ulrich (1997). "New results about the bondage number of a graph". Discrete Mathematics. 171 (1–3): 249–259. doi:10.1016/S0012-365X(96)00007-6.
  155. mdevos (May 4, 2007). "5-flow conjecture". Open Problem Garden. Archived from the original on November 26, 2018.
  156. mdevos (March 31, 2010). "4-flow conjecture". Open Problem Garden. Archived from the original on November 26, 2018.
  157. Hrushovski, Ehud (1989). "Kueker's conjecture for stable theories". Journal of Symbolic Logic. 54 (1): 207–220. doi:10.2307/2275025. JSTOR 2275025. S2CID 41940041.
  158. 1 2 3 Shelah S (1990). Classification Theory. North-Holland.
  159. Shelah, Saharon (2009). Classification theory for abstract elementary classes. College Publications. ISBN 978-1-904987-71-0.
  160. Peretz, Assaf (2006). "Geometry of forking in simple theories". Journal of Symbolic Logic. 71 (1): 347–359. arXiv:math/0412356. doi:10.2178/jsl/1140641179. S2CID 9380215.
  161. Cherlin, Gregory; Shelah, Saharon (May 2007). "Universal graphs with a forbidden subtree". Journal of Combinatorial Theory. Series B. 97 (3): 293–333. arXiv:math/0512218. doi:10.1016/j.jctb.2006.05.008. S2CID 10425739.
  162. Džamonja, Mirna, "Club guessing and the universal models." On PCF, ed. M. Foreman, (Banff, Alberta, 2004).
  163. Shelah, Saharon (1999). "Borel sets with large squares". Fundamenta Mathematicae. 159 (1): 1–50. arXiv:math/9802134. Bibcode:1998math......2134S. doi:10.4064/fm-159-1-1-50. S2CID 8846429.
  164. Baldwin, John T. (July 24, 2009). Categoricity (PDF). American Mathematical Society. ISBN 978-0-8218-4893-7. Archived (PDF) from the original on July 29, 2010. Retrieved February 20, 2014.
  165. Shelah, Saharon (2009). "Introduction to classification theory for abstract elementary classes". arXiv:0903.3428 [math.LO].
  166. Gurevich, Yuri, "Monadic Second-Order Theories," in J. Barwise, S. Feferman, eds., Model-Theoretic Logics (New York: Springer-Verlag, 1985), 479–506.
  167. Makowsky J, "Compactness, embeddings and definability," in Model-Theoretic Logics, eds Barwise and Feferman, Springer 1985 pps. 645–715.
  168. Keisler, HJ (1967). "Ultraproducts which are not saturated". J. Symb. Log. 32 (1): 23–46. doi:10.2307/2271240. JSTOR 2271240. S2CID 250345806.
  169. Malliaris, Maryanthe; Shelah, Saharon (20 December 2013). "A dividing line within simple unstable theories". Advances in Mathematics. 249: 250–288. arXiv:1208.2140. doi:10.1016/j.aim.2013.08.027.
  170. Rathjen, Michael (2023-08-01). "The Art of Measuring the Strength of Theories" (PDF). Notices of the American Mathematical Society. 70 (7): 1071–1079. doi:10.1090/noti2733. ISSN 0002-9920.
  171. Singmaster, David (1971). "Research Problems: How often does an integer occur as a binomial coefficient?". American Mathematical Monthly. 78 (4): 385–386. doi:10.2307/2316907. JSTOR 2316907. MR 1536288..
  172. Guo, Song; Sun, Zhi-Wei (2005). "On odd covering systems with distinct moduli". Advances in Applied Mathematics. 35 (2): 182–187. arXiv:math/0412217. doi:10.1016/j.aam.2005.01.004. MR 2152886. S2CID 835158.
  173. "Are the Digits of Pi Random? Berkeley Lab Researcher May Hold Key". Archived from the original on 2016-03-27. Retrieved 2016-03-18.
  174. Conrey, Brian (2016). "Lectures on the Riemann zeta function (book review)". Bulletin of the American Mathematical Society. 53 (3): 507–512. doi:10.1090/bull/1525.
  175. Guy, Richard K. (1991). Unsolved Problems in Number Theory. Problem Books in Mathematics. Vol. 1 (2nd ed.). Springer-Verlag. pp. 181–185. doi:10.1007/978-1-4899-3585-4. ISBN 978-1-4899-3587-8.
  176. 1 2 Waldschmidt, Michel (2013). Diophantine Approximation on Linear Algebraic Groups: Transcendence Properties of the Exponential Function in Several Variables. Springer. pp. 14, 16. ISBN 978-3-662-11569-5.
  177. Waldschmidt, Michel (2008). An introduction to irrationality and transcendence methods (PDF). 2008 Arizona Winter School. Archived from the original (PDF) on 16 December 2014. Retrieved 15 December 2014.
  178. Albert, John. Some unsolved problems in number theory (PDF). Archived from the original (PDF) on 17 January 2014. Retrieved 15 December 2014.
  179. For some background on the numbers in this problem, see articles by Eric W. Weisstein at Wolfram MathWorld (all articles accessed 22 August 2024):
  180. 1 2 Waldschmidt, Michel (2003-12-24). "Open Diophantine Problems". arXiv:math/0312440.
  181. Kontsevich, Maxim; Zagier, Don (2001). "Periods". In Engquist, Björn; Schmid, Wilfried (eds.). Mathematics Unlimited — 2001 and Beyond. Berlin, Heidelberg: Springer. pp. 771–808. doi:10.1007/978-3-642-56478-9_39. ISBN 978-3-642-56478-9. Retrieved 2024-08-22.
  182. Weisstein, Eric W. "Khinchin's Constant". mathworld.wolfram.com. Retrieved 2024-09-22.
  183. Aigner, Martin (2013). Markov's theorem and 100 years of the uniqueness conjecture. Cham: Springer. doi:10.1007/978-3-319-00888-2. ISBN 978-3-319-00887-5. MR 3098784.
  184. Huisman, Sander G. (2016). "Newer sums of three cubes". arXiv:1604.07746 [math.NT].
  185. Dobson, John Blythe (1 April 2017). "On Lerch's formula for the Fermat quotient". p. 23. arXiv:1103.3907v6 [math.NT].
  186. Ribenboim, P. (2006). Die Welt der Primzahlen. Springer-Lehrbuch (in German) (2nd ed.). Springer. pp. 242–243. doi:10.1007/978-3-642-18079-8. ISBN 978-3-642-18078-1.
  187. Mazur, Barry (1992). "The topology of rational points". Experimental Mathematics. 1 (1): 35–45. doi:10.1080/10586458.1992.10504244. S2CID 17372107. Archived from the original on 2019-04-07. Retrieved 2019-04-07.
  188. Kuperberg, Greg (1994). "Quadrisecants of knots and links". Journal of Knot Theory and Its Ramifications. 3: 41–50. arXiv:math/9712205. doi:10.1142/S021821659400006X. MR 1265452. S2CID 6103528.
  189. Burklund, Robert; Hahn, Jeremy; Levy, Ishan; Schlank, Tomer (2023). "K-theoretic counterexamples to Ravenel's telescope conjecture". arXiv:2310.17459 [math.AT].
  190. "Celebratio Mathematica — Eliashberg — Generating functions". Celebratio.org. Retrieved June 16, 2026.
  191. Matthew Sparkes (July 20, 2026). "AI's solution to 87-year-old riddle takes mathematicians by surprise". New Scientist.
  192. @__alpoge__ (July 20, 2026). "hello there the jacobian conjecture is false" (Tweet) via X (formerly Twitter).
  193. Weisstein, Eric W. "Jacobian Conjecture". MathWorld.
  194. Dimitrov, Vessilin; Gao, Ziyang; Habegger, Philipp (2021). "Uniformity in Mordell–Lang for curves" (PDF). Annals of Mathematics. 194: 237–298. arXiv:2001.10276. doi:10.4007/annals.2021.194.1.4. S2CID 210932420.
  195. Guan, Qi'an; Zhou, Xiangyu (2015). "A solution of an L 2 {\displaystyle L^{2}} extension problem with optimal estimate and applications". Annals of Mathematics. 181 (3): 1139–1208. arXiv:1310.7169. doi:10.4007/annals.2015.181.3.6. JSTOR 24523356. S2CID 56205818.
  196. "Ten advances in mathematics and theoretical computer science". OpenAI. 2026-07-29. Retrieved 2026-08-01.
  197. Duncan, John F. R.; Griffin, Michael J.; Ono, Ken (1 December 2015). "Proof of the umbral moonshine conjecture". Research in the Mathematical Sciences. 2 (1): 26. arXiv:1503.01472. Bibcode:2015arXiv150301472D. doi:10.1186/s40687-015-0044-7. S2CID 43589605.
  198. "A Computer-Assisted Proof of Sendov's Conjecture" (PDF). Proofatlas.ai. Retrieved 2026-08-28.
  199. "A digestion of the proof of Sendov's conjecture". Terrence Tao's Blog. 2026-08-12. Retrieved 2026-08-20.
  200. "A partial digestion of the HRT counterexample". Terrence Tao's Blog. 2026-08-06. Retrieved 2026-08-20.
  201. Hartnett, Kevin (2025-08-01). "At 17, Hannah Cairo Solved a Major Math Mystery". Quanta Magazine. Retrieved 2025-08-08.
  202. Cairo, Hannah (2025). "A Counterexample to the Mizohata-Takeuchi Conjecture". arXiv:2502.06137 [math.CA].
  203. "OpenAI disproves Erdős unit distance conjecture". Wolfram Community.
  204. "Planar Point Sets with Many Unit Distances" (PDF). OpenAI.
  205. Gladkov, Nikita; Pak, Igor; Zimin, Aleksandr (2025-06-17). "The bunkbed conjecture is false". Proceedings of the National Academy of Sciences. 122 (24) e2420725122. arXiv:2410.02545. Bibcode:2025PNAS..12220725G. doi:10.1073/pnas.2420725122. PMC 12184427. PMID 40512791.
  206. Moreira, Joel; Richter, Florian K.; Robertson, Donald (2019). "A proof of a sumset conjecture of Erdős". Annals of Mathematics. 189 (2): 605–652. arXiv:1803.00498. doi:10.4007/annals.2019.189.2.4. S2CID 119158401.
  207. Bisztriczky, Tibor; McMullen, Peter; Schneider, Rolf; Weiss, Asia Ivic; Stanley, Richard P. (2012-12-06). "A survey of Eulerian posets". Polytopes: Abstract, Convex and Computational. Springer Science & Business Media. pp. 301–333. ISBN 978-94-011-0924-6.
  208. Kalai, Gil (2018-12-25). "Amazing: Karim Adiprasito proved the g-conjecture for spheres!". Archived from the original on 2019-02-16. Retrieved 2019-02-15.
  209. Ellenberg, Jordan S.; Gijswijt, Dion (2017). "On large subsets of F q n {\displaystyle \mathbb {F} _{q}^{n}} with no three-term arithmetic progression". Annals of Mathematics. 185 (1): 339–343. doi:10.4007/annals.2017.185.1.8. MR 3583358. Zbl 06686590.{{cite journal}}: CS1 maint: Zbl (link)
  210. Tao, Terence (2015). "The Erdős discrepancy problem". arXiv:1509.05363v5 [math.CO].
  211. Martí-Pete, David; Rempe, Lasse; Waterman, James (2025). "Eremenko's conjecture, wandering Lakes of Wada, and maverick points". Journal of the American Mathematical Society. 38 (4): 877–918. arXiv:2108.10256. doi:10.1090/jams/1049.
  212. Brown, Aaron; Fisher, David; Hurtado, Sebastian (2017-10-07). "Zimmer's conjecture for actions of SL(𝑚,ℤ)". arXiv:1710.02735 [math.DS].
  213. Richard P Mann. "Known Historical Beggar-My-Neighbour Records". Retrieved 2024-02-10.
  214. Casella, Brayden; Anderson, Philip M.; Kleber, Michael; Mann, Richard P.; Nessler, Reed; Rucklidge, William; Williams, Samuel G.; Wu, Nicolas (2025-11-26). "A Non-Terminating Game of Beggar-My-Neighbor". The American Mathematical Monthly. 132 (10): 978–994. doi:10.1080/00029890.2025.2558484. ISSN 0002-9890.
  215. Kasal, Krystal (24 May 2026). Clark, Gaby; Egan, Robert (eds.). "Mathematicians solve decades-old mystery about the hidden order in high-dimensional randomness". Phys.org.
  216. Howlett, Joseph (19 May 2026). Billings, Lee (ed.). "'Sensational' proof topples decades-old geometry problem". Scientific American.
  217. Guilfoyle, B.; Klingenberg, W. (2025). "The three obdurate conjectures of differential geometry". Math. Proc. R. Ir. Acad. 125A: 9–17. arXiv:2502.11716. doi:10.1353/mpr.2025.a968272.
  218. Smith, David; Myers, Joseph Samuel; Kaplan, Craig S.; Goodman-Strauss, Chaim (2024). "An aperiodic monotile". Combinatorial Theory. 4 (1). doi:10.5070/C64163843. ISSN 2766-1334.
  219. Drozdov, Sergei (2025-12-31). "Egan conjecture holds". Discrete Applied Mathematics. 377: 562–572. arXiv:2310.10816. doi:10.1016/j.dam.2025.08.034. S2CID 264172309.
  220. https://alpo.ge/s6.pdf
  221. https://philip-engel.github.io/S6.pdf
  222. "Plby/HopfProblem". GitHub.
  223. Brakensiek, Joshua; Heule, Marijn; Mackey, John; Narváez, David (2020). Peltier, Nicolas; Sofronie-Stokkermans, Viorica (eds.). "The Resolution of Keller's Conjecture". Automated Reasoning. 12166. Cham: Springer International Publishing: 48–65. arXiv:1910.03740. doi:10.1007/978-3-030-51074-9_4. ISBN 978-3-030-51073-2. PMC 7324133. S2CID 203951899.{{citation}}: CS1 maint: work parameter with ISBN (link)
  224. Larson, Eric (2017). "The Maximal Rank Conjecture". arXiv:1711.04906 [math.AG].
  225. Kerz, Moritz; Strunk, Florian; Tamme, Georg (2018). "Algebraic K-theory and descent for blow-ups". Inventiones Mathematicae. 211 (2): 523–577. arXiv:1611.08466. Bibcode:2018InMat.211..523K. doi:10.1007/s00222-017-0752-2. MR 3748313. S2CID 253741858.
  226. Song, Antoine. "Existence of infinitely many minimal hypersurfaces in closed manifolds" (PDF). www.ams.org. Retrieved 19 June 2021. ..I will present a solution of the conjecture, which builds on min-max methods developed by F. C. Marques and A. Neves..
  227. "Antoine Song | Clay Mathematics Institute". ...Building on work of Codá Marques and Neves, in 2018 Song proved Yau's conjecture in complete generality
  228. Wolchover, Natalie (July 11, 2017). "Pentagon Tiling Proof Solves Century-Old Math Problem". Quanta Magazine. Archived from the original on August 6, 2017. Retrieved July 18, 2017.
  229. Sparkes, Matthew (23 July 2026). "Extremely basic AI prompt cracks decades-old maths problem". New Scientist.
  230. Park, Jinyoung; Pham, Huy Tuan (2024). "A Proof of the Kahn-Kalai Conjecture". Journal of the American Mathematical Society. 37: 235–243. arXiv:2203.17207. doi:10.1090/jams/1028.
  231. Dujmović, Vida; Eppstein, David; Hickingbotham, Robert; Morin, Pat; Wood, David R. (August 2021). "Stack-number is not bounded by queue-number". Combinatorica. 42 (2): 151–164. arXiv:2011.04195. doi:10.1007/s00493-021-4585-7. S2CID 226281691.
  232. Huang, C.; Kotzig, A.; Rosa, A. (1982). "Further results on tree labellings". Utilitas Mathematica. 21: 31–48. MR 0668845..
  233. Hartnett, Kevin (19 February 2020). "Rainbow Proof Shows Graphs Have Uniform Parts". Quanta Magazine. Retrieved 2020-02-29.
  234. Shitov, Yaroslav (1 September 2019). "Counterexamples to Hedetniemi's conjecture". Annals of Mathematics. 190 (2): 663–667. arXiv:1905.02167. doi:10.4007/annals.2019.190.2.6. JSTOR 10.4007/annals.2019.190.2.6. MR 3997132. S2CID 146120733. Zbl 1451.05087. Retrieved 19 July 2021.
  235. He, Dawei; Wang, Yan; Yu, Xingxing (2019-12-11). "The Kelmans-Seymour conjecture I: Special separations". Journal of Combinatorial Theory, Series B. 144: 197–224. arXiv:1511.05020. doi:10.1016/j.jctb.2019.11.008. ISSN 0095-8956. S2CID 29791394.
  236. He, Dawei; Wang, Yan; Yu, Xingxing (2019-12-11). "The Kelmans-Seymour conjecture II: 2-Vertices in K4−". Journal of Combinatorial Theory, Series B. 144: 225–264. arXiv:1602.07557. doi:10.1016/j.jctb.2019.11.007. ISSN 0095-8956. S2CID 220369443.
  237. He, Dawei; Wang, Yan; Yu, Xingxing (2019-12-09). "The Kelmans-Seymour conjecture III: 3-vertices in K4−". Journal of Combinatorial Theory, Series B. 144: 265–308. arXiv:1609.05747. doi:10.1016/j.jctb.2019.11.006. ISSN 0095-8956. S2CID 119625722.
  238. He, Dawei; Wang, Yan; Yu, Xingxing (2019-12-19). "The Kelmans-Seymour conjecture IV: A proof". Journal of Combinatorial Theory, Series B. 144: 309–358. arXiv:1612.07189. doi:10.1016/j.jctb.2019.12.002. ISSN 0095-8956. S2CID 119175309.
  239. Zang, Wenan; Jing, Guangming; Chen, Guantao (2019-01-29). "Proof of the Goldberg–Seymour Conjecture on Edge-Colorings of Multigraphs". arXiv:1901.10316v1 [math.CO].
  240. Abdollahi A., Zallaghi M. (2015). "Character sums for Cayley graphs". Communications in Algebra. 43 (12): 5159–5167. doi:10.1080/00927872.2014.967398. S2CID 117651702.
  241. Pila, Jonathan; Shankar, Ananth; Tsimerman, Jacob; Esnault, Hélène; Groechenig, Michael (2021-09-17). "Canonical Heights on Shimura Varieties and the André-Oort Conjecture". arXiv:2109.08788 [math.NT].
  242. Koukoulopoulos, Dimitris; Maynard, James (2020-07-01). "On the Duffin-Schaeffer conjecture". Annals of Mathematics. 192 (1): 251–307. arXiv:1907.04594. doi:10.4007/annals.2020.192.1.5. JSTOR 10.4007/annals.2020.192.1.5. S2CID 195874052.
  243. Bourgain, Jean; Ciprian, Demeter; Larry, Guth (2015). "Proof of the main conjecture in Vinogradov's Mean Value Theorem for degrees higher than three". Annals of Mathematics. 184 (2): 633–682. arXiv:1512.01565. Bibcode:2015arXiv151201565B. doi:10.4007/annals.2016.184.2.7. hdl:1721.1/115568. S2CID 43929329.
  244. Lee, Choongbum (2017). "Ramsey numbers of degenerate graphs". Annals of Mathematics. 185 (3): 791–829. arXiv:1505.04773. doi:10.4007/annals.2017.185.3.2. S2CID 7974973.
  245. Lamb, Evelyn (26 May 2016). "Two-hundred-terabyte maths proof is largest ever". Nature. 534 (7605): 17–18. Bibcode:2016Natur.534...17L. doi:10.1038/nature.2016.19990. PMID 27251254.
  246. Heule, Marijn J. H.; Kullmann, Oliver; Marek, Victor W. (2016). "Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer". In Creignou, N.; Le Berre, D. (eds.). Theory and Applications of Satisfiability Testing – SAT 2016. Lecture Notes in Computer Science. Vol. 9710. Springer, [Cham]. pp. 228–245. arXiv:1605.00723. doi:10.1007/978-3-319-40970-2_15. ISBN 978-3-319-40969-6. MR 3534782. S2CID 7912943.
  247. Linkletter, David (27 December 2019). "The 10 Biggest Math Breakthroughs of 2019". Popular Mechanics. Retrieved 20 June 2021.
  248. Piccirillo, Lisa (2020). "The Conway knot is not slice". Annals of Mathematics. 191 (2): 581–591. doi:10.4007/annals.2020.191.2.5. S2CID 52398890.
  249. Klarreich, Erica (2020-05-19). "Graduate Student Solves Decades-Old Conway Knot Problem". Quanta Magazine. Retrieved 2022-08-17.

Books discussing problems solved since 1995

[edit source]