List of unsolved problems in mathematics

Since the Renaissance, every century has seen the solution of more mathematical problems than the century before, and yet many
mathematical problems, both major and minor, still remain unsolved.[1] Prizes are often awarded for the solution to a long-standing
problem, and lists of unsolved problems (such as the list of Millennium Prize Problems) receive considerable attention. Unsolved
problems remain in multiple domains, includingphysics, computer science, algebra, additive and algebraic number theories, analysis,
combinatorics, algebraic, discrete and Euclidean geometries, graph, group, model, number, set and Ramsey theories, dynamical
systems, partial differential equations, and miscellaneous unsolved problems.

Contents
Lists of unsolved problems in mathematics
Millennium Prize Problems
Unsolved problems
Algebra
Algebraic geometry
Analysis
Combinatorics
Differential geometry
Discrete geometry
Euclidean geometry
Dynamical systems
Games and puzzles
Graph theory
Paths and cycles in graphs
Graph coloring and labeling
Graph drawing
Miscellaneous graph theory
Group theory
Model theory
Number theory
General
Additive number theory
Algebraic number theory
Combinatorial number theory
Prime numbers
Partial differential equations
Ramsey theory
Set theory
Topology
Other
Problems solved since 1995
References
Further reading
Books discussing recently solved problems[needs update ]
Books discussing unsolved problems
External links
Lists of unsolved problems in mathematics
Over the course of time, several lists of unsolved mathematical problems have appeared.

Number of Proposed
List Proposed by
problems in

Hilbert's problems[2] 23 David Hilbert 1900

Landau's problems[3] 4 Edmund Landau 1912

Taniyama's problems[4] 36 Yutaka Taniyama 1955

Thurston's 24 questions[5][6] 24 William Thurston 1982

Smale's problems 18 Stephen Smale 1998

Millennium Prize problems 7 Clay Mathematics Institute 2000
Unsolved Problems on Mathematics for the 21st Jair Minoro Abe, Shotaro
22 2001
Century[7] Tanaka

DARPA's math challenges[8][9] 23 DARPA 2007

Millennium Prize Problems

Of the original seven Millennium Prize Problems set by the Clay Mathematics Institute in 2000, six have yet to be solved, as of
2017:[10]

P versus NP
Hodge conjecture
Riemann hypothesis
Yang–Mills existence and mass gap
Navier–Stokes existence and smoothness
Birch and Swinnerton-Dyer conjecture
The seventh problem, the Poincaré conjecture, has been solved.[11] The smooth four-dimensional Poincaré conjecture—that is,
whether a four-dimensional topological sphere can have two or more inequivalentsmooth structures—is still unsolved.[12]

Unsolved problems

Algebra
Homological conjectures in commutative algebra
Hilbert's sixteenth problem
Hilbert's fifteenth problem
Hadamard conjecture
Jacobson's conjecture
Existence of perfect cuboids and associated cuboid conjectures
Zauner's conjecture: existence of SIC-POVMs in all dimensions
Wild Problem: Classification of pairs ofn×n matrices under simultaneous conjugation and problems containing it
such as a lot of classification problems
Köthe conjecture
Birch–Tate conjecture
Serre's conjecture II
Bombieri–Lang conjecture
Farrell–Jones conjecture
Bost conjecture
 Uniformity conjecture
Kaplansky's conjecture
Kummer–Vandiver conjecture
Serre's multiplicity conjectures
Pierce–Birkhoff conjecture
Eilenberg–Ganea conjecture
Green's conjecture
Grothendieck–Katz p-curvature conjecture
Sendov's conjecture

Algebraic geometry
Bass conjecture
Deligne conjecture
Fröberg conjecture
Fujita conjecture
Hartshorne conjectures
The Jacobian conjecture
Manin conjecture
Nakai conjecture
Resolution of singularitiesin characteristic p
Standard conjectures on algebraic cycles
Section conjecture
Tate conjecture
Virasoro conjecture
Zariski multiplicity conjecture

Analysis
Schanuel's conjecture and four exponentials conjecture
Lehmer's conjecture
Pompeiu problem
2
Are (the Euler–Mascheroni constant), π + e, π − e, πe, π/e, πe, π√2, ππ, eπ , ln π, 2e, ee, Catalan's constant or
Khinchin's constant rational, algebraic irrational, or transcendental? What is the irrationality measure of each of
these numbers?[13][14][15]
Khabibullin's conjecture on integral inequalities
Hilbert's thirteenth problem
Vitushkin's conjecture

Combinatorics
Frankl's union-closed sets conjecture: for any family of sets closed under sums there exists an element (of the
underlying space) belonging to half or more of the sets [16]

The lonely runner conjecture: if runners with pairwise distinct speeds run round a track of unit length, will every
runner be "lonely" (that is, be at least a distance from each other runner) at some time?[17]
Singmaster's conjecture: is there a finite upper bound on the multiplicities of the entries greater than 1 in Pascal's
triangle?[18]
Finding a function to model n-stepself-avoiding walks.[19]
The 1/3–2/3 conjecture: does every finite partially ordered set that is not totally ordered contain two elements x and y
such that the probability thatx appears before y in a random linear extension is between 1/3 and 2/3?[20]
The uniqueness conjecture for Markov numbers[21]
Give a combinatorial interpretation of theKronecker coefficients.[22]
Differential geometry
Filling area conjecture
Hopf conjecture
Yau's conjecture

Discrete geometry
Solving the happy ending problem for arbitrary [23]

Finding matching upper and lower bounds fork-sets and halving lines[24]
The Hadwiger conjecture on covering n-dimensional convex bodies with at most 2n smaller copies[25]
The Kobon triangle problemon triangles in line arrangements[26]
The McMullen problem on projectively transforming sets of points intoconvex position[27]
[28]
Ulam's packing conjectureabout the identity of the worst-packing convex solid
[29]
Kissing number problemfor dimensions other than 1, 2, 3, 4, 8 and 24
How many unit distancescan be determined by a set ofn points in the Euclidean plane?[30]

Euclidean geometry
The einstein problem – does there exist a two-dimensional shape that forms theprototile for an aperiodic tiling, but
not for any periodic tiling?[31]
Inscribed square problem– does every Jordan curve have an inscribed square?[32]
Kakeya conjecture
[33]
Moser's worm problem– what is the smallest area of a shape that can cover every unit-length curve in the plane?
The moving sofa problem – what is the largest area of a shape that can be maneuvered through a unit-width L-
shaped corridor?[34]
Shephard's problem (a.k.a. Dürer's conjecture)– does every convex polyhedron have a net?[35]
The Thomson problem – what is the minimum energy configuration ofN particles bound to the surface of a unit
sphere that repel each other with a 1/r potential (or any potential in general)?
Falconer's conjecture
g-conjecture
Circle packing in an equilateral triangle
Circle packing in an isosceles right triangle
Is the Weaire–Phelan structurean optimal solution to the Kelvin problem?
Lebesgue's universal covering problem– what is the convex shape in the plane of least area which provides an
isometric cover for any shape of diameter one?
Bellman's lost in a forest problem– for a given shape of forest find the shortest escape path which will intersect the
edge of the forest at some point for any given starting point and direction inside the forest.
Find the complete set ofuniform 5-polytopes[36]
Covering problem of Rado
The strong bellows conjecture– must the Dehn invariant of a self-intersection free flexible polyhedron stay constant
as it flexes?
Dissection into orthoschemes– is it possible for simplices of every dimension?[37]

Dynamical systems
Collatz conjecture (3n + 1 conjecture)
Lyapunov's second method for stability– For what classes ofODEs, describing dynamical systems, does the
Lyapunov’s second method formulated in the classical and canonically generalized forms define the necessary and
sufficient conditions for the (asymptotical) stability of motion?
Furstenberg conjecture – Is every invariant andergodic measure for the action on the circle either Lebesgue
or atomic?
Margulis conjecture – Measure classification for diagonalizable actions in higher-rank groups
MLC conjecture – Is the Mandelbrot set locally connected?
 Weinstein conjecture – Does a regular compactcontact type level set of a Hamiltonian on a symplectic manifold
carry at least one periodic orbit of the Hamiltonian flow?
[38]
Is every reversible cellular automatonin three or more dimensions locally reversible?
Many problems concerning anouter billiard, for example show that outer billiards relative to almost every convex
polygon has unbounded orbits.

Games and puzzles

Chess (finding an optimal strategy for playing chess)
Sudoku (what is the maximum number of givensfor a minimal puzzle?)[39]
Sudoku (can every Sudoku be solved by logic, other than abrute-force analysis?)[39]
Sudoku (how many proper puzzles exist, i.e. puzzles with one solution?)[39]
[39]
Sudoku (how many minimal proper puzzles exist, i.e. minimal puzzles with one solution?)

Graph theory

Paths and cycles in graphs

[40]
Barnette's conjecture that every cubic bipartite three-connected planar graph has a Hamiltonian cycle
Chvátal's toughness conjecture, that there is a numbert such that every t-tough graph is Hamiltonian[41]
The cycle double cover conjecturethat every bridgeless graph has a family of cycles that includes each edge
twice[42]
The Erdős–Gyárfás conjectureon cycles with power-of-two lengths in cubic graphs [43]

The linear arboricity conjecture on decomposing graphs into disjoint unions of paths according to their maximum
degree[44]
The Lovász conjecture on Hamiltonian paths in symmetric graphs[45]
The Oberwolfach problem on which 2-regular graphs have the property that a complete graph on the same number
[46]
of vertices can be decomposed into edge-disjoint copies of the given graph.

Graph coloring and labeling

The Erdős–Faber–Lovász conjectureon coloring unions of cliques[47]

[48]
The Gyárfás–Sumner conjectureon χ-boundedness of graphs with a forbidden induced tree
The Hadwiger conjecture relating coloring to clique minors[49]
[50]
The Hadwiger–Nelson problemon the chromatic number of unit distance graphs
Hedetniemi's conjectureon the chromatic number of tensor products of graphs [51]

Jaeger's Petersen-coloring conjecturethat every bridgeless cubic graph has a cycle-continuous mapping to the
Petersen graph[52]
[53]
The list coloring conjecture that, for every graph, the list chromatic index equals the chromatic index
The Ringel–Kotzig conjectureon graceful labeling of trees[54]
The total coloring conjectureof Behzad and Vizing that the total chromaticnumber is at most two plus the maximum
degree[55]

Graph drawing

The Albertson conjecture that the crossing number can be lower-bounded by the crossing number of complete
a
graph with the same chromatic number[56]
The Blankenship–Oporowski conjectureon the book thickness of subdivisions[57]
Conway's thrackle conjecture[58]
[59]
Harborth's conjecture that every planar graph can be drawn with integer edge lengths
[60]
Negami's conjecture on projective-plane embeddings of graphs with planar covers
[61]
The strong Papadimitriou–Ratajczak conjecturethat every polyhedral graph has a convex greedy embedding
 Turán's brick factory problem– Is there a drawing of any complete bipartite graph with fewer crossings than the
number given by Zarankiewicz?[62]
Universal point sets of subquadratic size for planar graphs[63]

Miscellaneous graph theory

The Erdős–Hajnal conjectureon large cliques or independent sets in graphs with a forbidden induced subgraph [64]

The implicit graph conjectureon the existence of implicit representations for slowly-growinghereditary families of
graphs[65]
Jørgensen's conjecture that every 6-vertex-connectedK6-minor-free graph is anapex graph[66]
Meyniel's conjecture thatcop number is [67]

Deriving a closed-form expression for thepercolation threshold values, especially (square site)
Does a Moore graph with girth 5 and degree 57 exist?
What is the largest possiblepathwidth of an n-vertex cubic graph?
The reconstruction conjectureand new digraph reconstruction conjectureon whether a graph is uniquely determined
by its vertex-deleted subgraphs.
Sumner's conjecture: does every -vertex tournament contain as a subgraph every -vertex oriented
tree? [68]

Tutte's conjectures that every bridgeless graph has a nowhere-zero 5-flow and every Petersen-minor-free bridgeless
graph has a nowhere-zero 4-flow
Vizing's conjecture on the domination number of cartesian products of graphs[69]

Group theory
Is every finitely presented periodic group finite?
The inverse Galois problem: is every finite group the Galois group of a Galois extension of the rationals?
For which positive integersm, n is the free Burnside group B(m,n) finite? In particular, is B(2, 5) finite?
Is every group surjunctive?
Andrews–Curtis conjecture
Herzog–Schönheim conjecture
Does generalized moonshineexist?
Are there an infinite number ofLeinster Groups?

Model theory
Vaught's conjecture
The Cherlin–Zilber conjecture: A simple group whose first-order theory isstable in is a simple algebraic group
over an algebraically closed field.
The Main Gap conjecture, e.g. for uncountablefirst order theories, for AECs, and for -saturated models of a
countable theory.[70]
Determine the structure of Keisler's order[71][72]
The stable field conjecture: every infinite field with astable first-order theory is separably closed.
Is the theory of the field of Laurent series over decidable? of the field of polynomials over ?
(BMTO) Is the Borel monadic theory of the real order decidable? (MTWO) Is the monadic theory of well-ordering
consistently decidable?[73]
The Stable Forking Conjecture for simple theories[74]

For which number fields doesHilbert's tenth problem hold?

Assume K is the class of models of a countable first order theory omitting countably many
types. If K has a model of
cardinality does it have a model of cardinality continuum? [75]

Shelah's eventual Categority conjecture: For every cardinal there exists a cardinal such that If an AEC K with
LS(K)<= is categorical in a cardinal above then it is categorical in all cardinals above .[70][76]
Shelah's categoricity conjecture for : If a sentence is categorical above the Hanf number then it is categorical in
all cardinals above the Hanf number.[70]
 Is there a logic L which satisfies both the Beth property and Δ-interpolation, is compact but does not satisfy the
interpolation property?[77]
If the class of atomic models of a complete first order theory iscategorical in the , is it categorical in every
cardinal?[78][79]
Is every infinite, minimal field of characteristic zero algebraically closed? (minimal = no proper elementary
substructure)
Kueker's conjecture[80]
Does there exist an o-minimal first order theory with a trans-exponential (rapid growth) function?
Lachlan's decision problem
Does a finitely presented homogeneous structure for a finite relational language have finitely many reducts?
Do the Henson graphs have the finite model property? (e.g. triangle-free graphs)
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? [81]
[82]
The universality spectrum problem: Is there a first-order theory whose universality spectrum is minimum?

Number theory

General

Grand Riemann hypothesis

Generalized Riemann hypothesis

Riemann hypothesis
n conjecture

abc conjecture (Proof claimed in 2012, currently under review

.)
Hilbert's ninth problem
Hilbert's eleventh problem
Hilbert's twelfth problem
Carmichael's totient function conjecture
Erdős–Straus conjecture
Pillai's conjecture
Hall's conjecture
Lindelöf hypothesis
Montgomery's pair correlation conjecture
Hilbert–Pólya conjecture
Grimm's conjecture
Leopoldt's conjecture
Do any odd perfect numbers exist?
Are there infinitely manyperfect numbers?
Do quasiperfect numbers exist?
Do any odd weird numbers exist?
Do any Lychrel numbers exist?
Is 10 a solitary number?
Catalan–Dickson conjecture on aliquot sequences
Do any Taxicab(5, 2, n) exist for n > 1?
Brocard's problem: existence of integers, (n,m), such that n! + 1 = m2 other than n = 4, 5, 7
Beilinson conjecture
Littlewood conjecture
Szpiro's conjecture
Vojta's conjecture
Goormaghtigh conjecture
Congruent number problem(a corollary to Birch and Swinnerton-Dyer conjecture, per Tunnell's theorem)
Lehmer's totient problem: if φ(n) divides n − 1, must n be prime?
 Are there infinitely manyamicable numbers?
Are there any pairs of amicable numbers which have opposite parity?
Are there any pairs of relatively prime amicable numbers?
Are there infinitely manybetrothed numbers?
Are there any pairs of betrothed numbers which have same parity?
The Gauss circle problem – how far can the number of integer points in a circle centered at the origin be from the
area of the circle?
Piltz divisor problem, especially Dirichlet's divisor problem
Exponent pair conjecture
Is π a normal number (its digits are "random")?[83]
Casas-Alvero conjecture
Sato–Tate conjecture
Find value of De Bruijn–Newman constant
Which integers can be written as the sum of threeperfect cubes?[84]
Erdős–Moser problem: is 11 + 21 = 31 the only solution to theErdős–Moser equation?
Is there a covering system with odd distinct moduli?[85]

Additive number theory

Beal's conjecture
Fermat–Catalan conjecture
Goldbach's conjecture
The values of g(k) and G(k) in Waring's problem
Lander, Parkin, and Selfridge conjecture
Gilbreath's conjecture
Erdős conjecture on arithmetic progressions
Erdős–Turán conjecture on additive bases
Pollock octahedral numbers conjecture
Skolem problem
Determine growth rate ofrk(N) (see Szemerédi's theorem)
Minimum overlap problem
Do the Ulam numbers have a positive density?

Algebraic number theory

Are there infinitely manyreal quadratic number fieldswith unique factorization (Class number problem)?
Characterize all algebraic number fields that have somepower basis.
Stark conjectures (including Brumer–Stark conjecture)
Kummer–Vandiver conjecture

Combinatorial number theory

Singmaster's conjecture: Is there a finite upper bound on the number of times that a number other than 1 can appear
in Pascal's triangle?

Prime numbers

Brocard's Conjecture
Catalan's Mersenne conjecture
Agoh–Giuga conjecture
The Gaussian moat problem: is it possible to find an infinite sequence of distinctGaussian prime numberssuch that
the difference between consecutive numbersin the sequence is bounded?
New Mersenne conjecture
Erdős–Mollin–Walsh conjecture
 Are there infinitely manyprime quadruplets?
Are there infinitely manycousin primes?
Are there infinitely manysexy primes?
Are there infinitely manyMersenne primes (Lenstra–Pomerance–Wagstaff conjecture); equivalently, infinitely many
even perfect numbers?
Are there infinitely manyWagstaff primes?
Are there infinitely manySophie Germain primes?
Are there infinitely manyPierpont primes?
Are there infinitely manyregular primes, and if so is their relative density ?
For any given integer b which is not a perfect power and not of the form k4
−4 for integer k, are there infinitely many
repunit primes to base b?
Are there infinitely manyCullen primes?
Are there infinitely manyWoodall primes?
Are there infinitely manyCarol primes?
Are there infinitely manyKynea primes?
Are there infinitely manypalindromic primes to every base?
Are there infinitely manyFibonacci primes?
Are there infinitely manyLucas primes?
Are there infinitely manyPell primes?
Are there infinitely manyNewman–Shanks–Williams primes?
Are all Mersenne numbers of prime index square-free?
Are there infinitely manyWieferich primes?
Are there any Wieferich primes in base 47?
Are there any compositec satisfying 2c − 1 ≡ 1 (mod c2)?
For any given integer a > 0, are there infinitely many primesp such that ap − 1 ≡ 1 (mod p2)?[86]
Can a prime p satisfy 2p − 1 ≡ 1 (mod p2) and 3p − 1 ≡ 1 (mod p2) simultaneously?[87]
Are there infinitely manyWilson primes?
Are there infinitely manyWolstenholme primes?
Are there any Wall–Sun–Sun primes?
n
Is every Fermat number 22 + 1 composite for ?
Are all Fermat numberssquare-free?
For any given integer a which is not a square and does not equal to −1, are there infinitely many primes with
a as a
primitive root?
Artin's conjecture on primitive roots
Is 78,557 the lowest Sierpiński number (so-called Selfridge's conjecture)?
Is 509,203 the lowest Riesel number?
Fortune's conjecture (that noFortunate number is composite)
Landau's problems
Feit–Thompson conjecture
Does every prime number appear in theEuclid–Mullin sequence?
Does the converse of Wolstenholme's theoremhold for all natural numbers?
Elliott–Halberstam conjecture
Problems associated toLinnik's theorem
Find the smallest Skewes' number

Partial differential equations

Regularity of solutions ofVlasov–Maxwell equations
Regularity of solutions ofEuler equations

Ramsey theory
The values of the Ramsey numbers, particularly
 The values of the Van der Waerden numbers

Set theory
The problem of finding the ultimatecore model, one that contains all large cardinals.
If ℵω is a strong limit cardinal, then 2ℵω < ℵω1 (see Singular cardinals hypothesis). The best bound, ℵω4, was
obtained by Shelah using his pcf theory.
Woodin's Ω-hypothesis.
Does the consistency of the existence of a strongly compact cardinalimply the consistent existence of a
supercompact cardinal?
(Woodin) Does the Generalized Continuum Hypothesisbelow a strongly compact cardinalimply the Generalized
Continuum Hypothesiseverywhere?
Does there exist a Jónsson algebra on ℵω?
Without assuming the axiom of choice, can a nontrivial elementary embeddingV→V exist?
Does the Generalized Continuum Hypothesisentail for every singular cardinal ?
Does the Generalized Continuum Hypothesisimply the existence of anℵ2-Suslin tree?
Is OCA (Open coloring axiom) consistent with ?

Topology
Borel conjecture
Hilbert–Smith conjecture
Novikov conjecture
Unknotting problem
Zeeman conjecture

Other
List of unsolved problems in statistics
List of unsolved problems in computer science
List of unsolved problems in physics
Problems in loop theory and quasigroup theory
Problems in Latin squares
Invariant subspace problem
Kaplansky's conjectureson group rings
Painlevé conjecture
Dixmier conjecture
Baum–Connes conjecture
Prove Turing completeness for all unique elementary cellular automata
Generalized star height problem
Assorted sphere packing problems, e.g. the densest irregular hypersphere packings
Closed curve problem: Find (explicit) necessary and sufficient conditions that determine when, given two periodic
[88]
functions with the same period, the integral curve is closed.
Keating–Snaith conjecture
Kung–Traub conjecture
Atiyah conjecture on configurations
Toeplitz' conjecture (open since 1911)
Carathéodory conjecture
Weight-monodromy conjecture
Berry–Tabor conjecture
Birkhoff conjecture
Guralnick–Thompson conjecture
MNOP conjecture
 Mazur's conjectures
Rendezvous problem
Scholz conjecture
Nirenberg–Treves conjecture
Quantum unique ergodicity conjecture
Density hypothesis
Zhou conjecture
Erdős–Ulam problem

Problems solved since 1995

Pentagonal tiling (Michaël Rao, 2017)[89]
Erdős–Burr conjecture (Choongbum Lee, 2017)[90]
Boolean Pythagorean triples problem(Marijn Heule, Oliver Kullmann, Victor Marek, 2016)[91]
[92]
Babai's problem (Problem 3.3 in "Spectra of Cayley graphs") (A. Abdollahi, M. Zallaghi, 2015)
Main conjecture in Vinogradov's mean-valuetheorem (Jean Bourgain, Ciprian Demeter, Larry Guth, 2015)[93]
Erdős discrepancy problem(Terence Tao, 2015)[94]
Umbral moonshine conjecture (John F. R. Duncan, Michael J. Griffin, Ken Ono, 2015)[95]
Anderson conjecture (Cheeger, Naber, 2014)[96]
Gaussian correlation inequality(Thomas Royen, 2014)[97]
Goldbach's weak conjecture(Harald Helfgott, 2013)[98][99][100]
Kadison–Singer problem(Adam Marcus, Daniel Spielman and Nikhil Srivastava, 2013)[101][102] (and the
Feichtinger's conjecture, Anderson’s paving conjectures, Weaver’s discrepancy theoretic and conjectures,
Bourgain-Tzafriri conjecture and -conjecture)
Virtual Haken conjecture(Agol, Groves, Manning, 2012)[103] (and by work of Wise alsovirtually fibered conjecture)
Hsiang–Lawson's conjecture(Brendle, 2012)[104]
Willmore conjecture (Fernando Codá Marquesand André Neves, 2012)[105]
Ehrenpreis conjecture (Kahn, Markovic, 2011)[106]
Hanna Neumann conjecture(Mineyev, 2011)[107]
Bloch–Kato conjecture(Voevodsky, 2011)[108] (and Quillen–Lichtenbaum conjectureand by work of Geisser and
Levine (2001) also Beilinson–Lichtenbaum conjecture[109][110][111] )
Erdős distinct distances problem(Larry Guth, Netz Hawk Katz, 2011)[112]
Density theorem (Namazi, Souto, 2010)[113]
Hirsch conjecture (Francisco Santos Leal, 2010)[114][115]
Sidon set problem (J. Cilleruelo, I. Ruzsa and C. Vinuesa, 2010)[116]
Atiyah conjecture (Austin, 2009)[117]
Kauffman–Harary conjecture(Matmann, Solis, 2009)[118]
Surface subgroup conjecture(Kahn, Markovic, 2009)[119]
[120]
Scheinerman's conjecture(Jeremie Chalopin and Daniel Gonçalves, 2009)
Cobordism hypothesis (Jacob Lurie, 2008)[121]
Full classification of finite simple groups(Harada, Solomon, 2008)
Geometrization conjecture(proof was completed by Morgan and Tian in 2008[122] and it is based mostly on work of
Grigori Perelman, 2002)[123]
Serre's modularity conjecture(Chandrashekhar Khareand Jean-Pierre Wintenberger, 2008)[124][125][126]
Heterogeneous tiling conjecture (squaring the plane)(Frederick V. Henle and James M. Henle, 2008)[127]
Erdős–Menger conjecture(Aharoni, Berger 2007)[128]
Road coloring conjecture(Avraham Trahtman, 2007)[129]
The angel problem (Various independent proofs, 2006)[130][131][132][133]
Lax conjecture (Lewis, Parrilo, Ramana, 2005)[134]
The Langlands–Shelstad fundamental lemma(Ngô Bảo Châu and Gérard Laumon, 2004)[135]
Tameness conjecture and Ahlfors measure conjecture(Ian Agol, 2004)[136]
 Robertson–Seymour theorem(Robertson, Seymour, 2004)[137]
Stanley–Wilf conjecture(Gábor Tardos and Adam Marcus, 2004)[138] (and also Alon–Friedgut conjecture)
Green–Tao theorem (Ben J. Green and Terence Tao, 2004)[139]
Ending lamination theorem(Jeffrey F. Brock, Richard D. Canary, Yair N. Minsky, 2004)[140]
Carpenter's rule problem(Connelly, Demaine, Rote, 2003)[141]
Cameron–Erdős conjecture(Ben J. Green, 2003, Alexander Sapozhenko, 2003)[142][143]
Milnor conjecture (Vladimir Voevodsky, 2003)[144]
Kemnitz's conjecture (Reiher, 2003, di Fiore, 2003)[145]
Nagata's conjecture (Shestakov, Umirbaev, 2003)[146]
Kirillov's conjecture (Baruch, 2003)[147]
Poincaré conjecture (Grigori Perelman, 2002)[123]
Strong perfect graph conjecture(Maria Chudnovsky, Neil Robertson, Paul Seymour and Robin Thomas, 2002)[148]
Kouchnirenko’s conjecture (Haas, 2002)[149]
Vaught conjecture (Knight, 2002)[150]
Double bubble conjecture(Hutchings, Morgan, Ritoré, Ros, 2002)[151]
Catalan's conjecture (Preda Mihăilescu, 2002)[152]
n! conjecture (Haiman, 2001)[153] (and also Macdonald positivity conjecture)
Kato's conjecture (Auscher, Hofmann, Lacey, McIntosh and Tchamitchian, 2001)[154]
Deligne's conjecture on 1-motives(Luca Barbieri-Viale, Andreas Rosenschon,Morihiko Saito, 2001)[155]
Modularity theorem (Breuil, Conrad, Diamond and Taylor, 2001)[156]
Erdős–Stewart conjecture(Florian Luca, 2001)[157]
Berry–Robbins problem(Atiyah, 2000)[158]
Erdős–Graham problem(Croot, 2000)[159]
Honeycomb conjecture(Thomas Hales, 1999)[160]
Gradient conjecture (Krzysztof Kurdyka, Tadeusz Mostowski, Adam Parusinski, 1999)[161]
Bogomolov conjecture (Emmanuel Ullmo, 1998, Shou-Wu Zhang, 1998)[162][163]
Lafforgue's theorem (Laurent Lafforgue, 1998)[164]
Kepler conjecture (Ferguson, Hales, 1998)[165]
Dodecahedral conjecture(Hales, McLaughlin, 1998)[166]
Ganea conjecture (Iwase, 1997)[167]
Torsion conjecture (Merel, 1996)[168]
Harary's conjecture (Chen, 1996)[169]
Fermat's Last Theorem(Andrew Wiles and Richard Taylor, 1995)[170][171]

References
1. Eves, An Introduction to the History of Mathematics6th Edition, Thomson, 1990,ISBN 978-0-03-029558-4.
2. Thiele, Rüdiger (2005), "On Hilbert and his twenty-four problems", in an
V Brummelen, Glen, Mathematics and the
historian's craft. The Kenneth O. May Lectures, CMS Books in Mathematics/Ouvrages de Mathématiques de la
SMC, 21, pp. 243–295, ISBN 0-387-25284-3
3. Guy, Richard (1994), Unsolved Problems in Number Theory(https://books.google.com/books?id=EbLzBwAAQBAJ&
pg=PR7) (2nd ed.), Springer, p. vii, ISBN 978-1-4899-3585-4.
4. Shimura, G. (1989). "Yutaka Taniyama and his time" (http://blms.oxfordjournals.org/content/21/2/186)
. Bulletin of the
London Mathematical Society. 21 (2): 186–196. doi:10.1112/blms/21.2.186(https://doi.org/10.1112%2Fblms%2F21.
2.186).
5. http://www.uni-regensburg.de/Fakultaeten/nat_Fak_I/friedl/papers/dmv_091514.pdf
6. "THREE DIMENSIONAL MANIFOLDS, KLEINIAN GROUPS AND HYPERBOLIC GEOMETR Y" (http://www.ams.org/
journals/bull/1982-06-03/S0273-0979-1982-15003-0/S0273-0979-1982-15003-0.pdf)
(PDF).
 7. Abe, Jair Minoro; Tanaka, Shotaro (2001).Unsolved Problems on Mathematics for the 21st Century(https://books.go
ogle.com/books?id=yHzfbqtVGLIC&printsec=frontcover&dq=unsolved+problems+in+mathematics&hl=de&sa=X&ei=t
mX0ULyDHMjJsga1n4D4CQ&ved=0CDIQ6AEwAA#v=onepage&q&f=false). IOS Press. ISBN 9051994907.
8. "DARPA invests in math" (https://web.archive.org/web/20090304121240/http://edition.cnn.com/2008/TECH/science/
10/09/darpa.challenges/index.html). CNN. 2008-10-14. Archived fromthe original (http://edition.cnn.com/2008/TEC
H/science/10/09/darpa.challenges/index.html)on 2009-03-04. Retrieved 2013-01-14.
9. "Broad Agency Announcement (BAA 07-68) for Defense Sciences Of fice (DSO)" (https://web.archive.org/web/20121
001111057/http://www.math.utk.edu/~vasili/refs/darpa07.MathChallenges.html). DARPA. 2007-09-10. Archived from
the original (http://www.math.utk.edu/~vasili/refs/darpa07.MathChallenges.html)on 2012-10-01. Retrieved
2013-06-25.
10. "Millennium Problems" (http://claymath.org/millennium-problems).
11. "Poincaré Conjecture" (https://web.archive.org/web/20131215120130/http://www .claymath.org/millenium-problems/p
oincar%C3%A9-conjecture). Clay Mathematics Institute. Archived from the original (http://www.claymath.org/milleniu
m-problems/poincar%C3%A9-conjecture)on 2013-12-15.
12. "Smooth 4-dimensional Poincare conjecture"(http://www.openproblemgarden.org/?q=op/smooth_4_dimensional_poi
ncare_conjecture).
13. For background on the numbers that are the focus of this problem, see articles by Eric .WWeisstein, on pi ([1] (http://
mathworld.wolfram.com/Pi.html)), e ([2] (http://mathworld.wolfram.com/e.html)), Khinchin's Constant ([3] (http://math
world.wolfram.com/KhinchinsConstant.html)), irrational numbers ([4] (http://mathworld.wolfram.com/IrrationalNumbe
r.html)), transcendental numbers ([5] (http://mathworld.wolfram.com/TranscendentalNumber.html)), and irrationality
measures ([6] (http://mathworld.wolfram.com/IrrationalityMeasure.html) ) at Wolfram MathWorld, all articles accessed
15 December 2014.
14. Michel Waldschmidt, 2008, "An introduction ot irrationality and transcendence methods," at The University of Arizona
The Southwest Center for Arithmetic Geometry 2008 Arizona Winter School, March 15–19, 2008 (Special Functions
and Transcendence), see [7] (http://webusers.imj-prg.fr/~michel.waldschmidt/articles/pdf/A
WSLecture5.pdf),
accessed 15 December 2014.
15. John Albert, posting date unknown, "Some unsolved problems in number theory" [fromictor
V Klee & Stan Wagon,
"Old and New Unsolved Problems in Plane Geometry and Number Theory"], in University of Oklahoma Math 4513
course materials, see [8] (http://www2.math.ou.edu/~jalbert/courses/openprob2.pdf)
, accessed 15 December 2014.
16. Bruhn, Henning; Schaudt, Oliver (2015),"The journey of the union-closed sets conjecture"(http://www.zaik.uni-koel
n.de/~schaudt/UCSurvey.pdf) (PDF), Graphs and Combinatorics, 31 (6): 2043–2074, doi:10.1007/s00373-014-1515-
0 (https://doi.org/10.1007%2Fs00373-014-1515-0) , MR 3417215 (https://www.ams.org/mathscinet-getitem?mr=3417
215)
17. Tao, Terence (2017), Some remarks on the lonely runner conjecture
, arXiv:1701.02048 (https://arxiv.org/abs/1701.02
048)
18. Singmaster, D. (1971), "Research Problems: How often does an integer occur as a binomial coef
ficient?", American
Mathematical Monthly, 78 (4): 385–386, doi:10.2307/2316907 (https://doi.org/10.2307%2F2316907),
JSTOR 2316907 (https://www.jstor.org/stable/2316907), MR 1536288 (https://www.ams.org/mathscinet-getitem?mr=
1536288).
19. Liśkiewicz, Maciej; Ogihara, Mitsunori; T
oda, Seinosuke (2003-07-28)."The complexity of counting self-avoiding
walks in subgraphs of two-dimensional grids and hypercubes"(http://www.sciencedirect.com/science/article/pii/S030
439750300080X). Theoretical Computer Science. 304 (1): 129–156. doi:10.1016/S0304-3975(03)00080-X(https://d
oi.org/10.1016%2FS0304-3975%2803%2900080-X) .
20. 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 (https://doi.org/10.1007%2FBF01110378), MR 1368815 (https://w
ww.ams.org/mathscinet-getitem?mr=1368815).
21. Aigner, Martin (2013), Markov's theorem and 100 years of the uniqueness conjecture
, Cham: Springer,
doi:10.1007/978-3-319-00888-2(https://doi.org/10.1007%2F978-3-319-00888-2) , ISBN 978-3-319-00887-5,
MR 3098784 (https://www.ams.org/mathscinet-getitem?mr=3098784)
22. 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 (https://doi.org/10.2307%2F237154
2), MR 1507301 (https://www.ams.org/mathscinet-getitem?mr=1507301)
23. 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(https://doi.org/10.1090%2FS0273-09
79-00-00877-6), MR 1779413 (https://www.ams.org/mathscinet-getitem?mr=1779413); Suk, Andrew (2016), "On the
Erdős–Szekeres convex polygon problem",J. Amer. Math. Soc., 30: 1047–1053, arXiv:1604.08657 (https://arxiv.org/
abs/1604.08657) , doi:10.1090/jams/869 (https://doi.org/10.1090%2Fjams%2F869)
24. Dey, Tamal K. (1998), "Improved bounds for planark-sets and related problems",Discrete Comput. Geom., 19: 373–
382, doi:10.1007/PL00009354 (https://doi.org/10.1007%2FPL00009354), MR 1608878 (https://www.ams.org/mathsc
inet-getitem?mr=1608878); Tóth, Gábor (2001), "Point sets with manyk-sets", Discrete Comput. Geom., 26 (2):
187–194, doi:10.1007/s004540010022(https://doi.org/10.1007%2Fs004540010022), MR 1843435 (https://www.am
s.org/mathscinet-getitem?mr=1843435).
25. Boltjansky, V.; Gohberg, I. (1985), "11. Hadwiger's Conjecture",Results and Problems in Combinatorial Geometry
,
Cambridge University Press, pp. 44–46.
26. Weisstein, Eric W. "Kobon Triangle" (http://mathworld.wolfram.com/KobonTriangle.html). MathWorld.
27. Matoušek, Jiří (2002), Lectures on discrete geometry, Graduate Texts in Mathematics, 212, Springer-Verlag, New
York, p. 206, doi:10.1007/978-1-4613-0039-7(https://doi.org/10.1007%2F978-1-4613-0039-7) , ISBN 0-387-95373-6,
MR 1899299 (https://www.ams.org/mathscinet-getitem?mr=1899299)
28. Gardner, Martin (1995), New Mathematical Diversions (Revised Edition)
, Washington: Mathematical Association of
America, p. 251
29. Conway, John H.; Neil J.A. Sloane (1999), Sphere Packings, Lattices and Groups(3rd ed.), New York: Springer-
Verlag, pp. 21–22 (https://books.google.com/books?id=upYwZ6cQumoC&pg=P A21), ISBN 0-387-98585-9
30. 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 0-387-23815-8, MR 2163782 (http
s://www.ams.org/mathscinet-getitem?mr=2163782)
31. Socolar, Joshua E. S.; Taylor, Joan M. (2012), "Forcing nonperiodicity with a single tile",The Mathematical
Intelligencer, 34 (1): 18–28, arXiv:1009.1419 (https://arxiv.org/abs/1009.1419) , doi:10.1007/s00283-011-9255-y(htt
ps://doi.org/10.1007%2Fs00283-011-9255-y), MR 2902144 (https://www.ams.org/mathscinet-getitem?mr=2902144)
32. Matschke, Benjamin (2014), "A survey on the square peg problem",Notices of the American Mathematical Society
,
61 (4): 346–352, doi:10.1090/noti1100 (https://doi.org/10.1090%2Fnoti1100)
33. Norwood, Rick; Poole, George; Laidacker, Michael (1992), "The worm problem of Leo Moser",Discrete and
Computational Geometry, 7 (2): 153–162, doi:10.1007/BF02187832 (https://doi.org/10.1007%2FBF02187832),
MR 1139077 (https://www.ams.org/mathscinet-getitem?mr=1139077)
34. Wagner, Neal R. (1976), "The Sofa Problem" (http://www.cs.utsa.edu/~wagner/pubs/corner/corner_final.pdf) (PDF),
The American Mathematical Monthly, 83 (3): 188–189, doi:10.2307/2977022 (https://doi.org/10.2307%2F2977022),
JSTOR 2977022 (https://www.jstor.org/stable/2977022)
35. 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
36. ACW (May 24, 2012), "Convex uniform 5-polytopes"(http://www.openproblemgarden.org/op/convex_uniform_5_poly
topes), Open Problem Garden, retrieved 2016-10-04.
37. Brandts, Jan; Korotov, Sergey; Křížek, Michal; Šolc, Jakub (2009), "On nonobtuse simplicial partitions",SIAM
Review, 51 (2): 317–335, doi:10.1137/060669073 (https://doi.org/10.1137%2F060669073), MR 2505583 (https://ww
w.ams.org/mathscinet-getitem?mr=2505583). See in particular Conjecture 23, p. 327.
38. Kari, Jarkko (2009), "Structure of reversible cellular automata",Unconventional Computation: 8th International
Conference, UC 2009, Ponta Delgada, Portugal, September 7ÔÇô11, 2009, Proceedings , Lecture Notes in
Computer Science, 5715, Springer, p. 6, doi:10.1007/978-3-642-03745-0_5(https://doi.org/10.1007%2F978-3-642-0
3745-0_5)
39. http://english.log-it-ex.com(http://english.log-it-ex.com/2.html)Ten open questions about Sudoku (2012-01-21).
40. Florek, Jan (2010), "On Barnette's conjecture",Discrete Mathematics, 310 (10–11): 1531–1535,
doi:10.1016/j.disc.2010.01.018(https://doi.org/10.1016%2Fj.disc.2010.01.018), MR 2601261 (https://www.ams.org/
mathscinet-getitem?mr=2601261).
41. Broersma, Hajo; Patel, Viresh; Pyatkin, Artem (2014), "On toughness and Hamiltonicity of $2K_2$-free graphs",
Journal of Graph Theory, 75 (3): 244–255, doi:10.1002/jgt.21734 (https://doi.org/10.1002%2Fjgt.21734),
MR 3153119 (https://www.ams.org/mathscinet-getitem?mr=3153119)
42. Jaeger, F. (1985), "A survey of the cycle double cover conjecture",Annals of Discrete Mathematics 27 – Cycles in
Graphs, North-Holland Mathematics Studies,27, pp. 1–12, doi:10.1016/S0304-0208(08)72993-1(https://doi.org/10.1
016%2FS0304-0208%2808%2972993-1).
43. Heckman, Christopher Carl; Krakovski, Roi (2013),"Erdös-Gyárfás conjecture for cubic planar graphs"(http://www.c
ombinatorics.org/ojs/index.php/eljc/article/view/v20i2p7)
, Electronic Journal of Combinatorics, 20 (2), P7.
44. 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(https://doi.org/10.1002%2Fnet.3230110108) , MR 0608921 (h
ttps://www.ams.org/mathscinet-getitem?mr=0608921).
45. L. Babai, Automorphism groups, isomorphism, reconstruction(http://www.cs.uchicago.edu/research/publications/tec
hreports/TR-94-10), in Handbook of Combinatorics, Vol. 2, Elsevier, 1996, 1447–1540.
46. 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(https://doi.org/10.1016%2F0012-365X%2891%2
990416-Y), MR 1140782 (https://www.ams.org/mathscinet-getitem?mr=1140782)
47. Chung, Fan; Graham, Ron (1998), Erdős on Graphs: His Legacy of Unsolved Problems
, A K Peters, pp. 97–99.
48. 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(https://doi.org/10.1016%2Fj.jctb.2013.11.002)
,
MR 3171779 (https://www.ams.org/mathscinet-getitem?mr=3171779)
49. Toft, Bjarne (1996), "A survey of Hadwiger's conjecture", Congressus Numerantium, 115: 249–283, MR 1411244 (htt
ps://www.ams.org/mathscinet-getitem?mr=1411244).
50. Croft, Hallard T.; Falconer, Kenneth J.; Guy, Richard K. (1991), Unsolved Problems in Geometry, Springer-Verlag,
Problem G10.
51. Sauer, N. (2001), "Hedetniemi's conjecture: asurvey", Discrete Mathematics, 229 (1–3): 261–292,
doi:10.1016/S0012-365X(00)00213-2(https://doi.org/10.1016%2FS0012-365X%2800%2900213-2) , MR 1815610 (ht
tps://www.ams.org/mathscinet-getitem?mr=1815610).
52. Hägglund, Jonas; Steffen, Eckhard (2014), "Petersen-colorings and some families of snarks"(http://amc-journal.eu/i
ndex.php/amc/article/viewFile/288/247), Ars Mathematica Contemporanea, 7 (1): 161–173, MR 3047618 (https://ww
w.ams.org/mathscinet-getitem?mr=3047618).
53. Jensen, Tommy R.; Toft, Bjarne (1995), "12.20 List-Edge-Chromatic Numbers",Graph Coloring Problems, New York:
Wiley-Interscience, pp. 201–202,ISBN 0-471-02865-7.
54. Huang, C.; Kotzig, A.; Rosa, A. (1982), "Further results on tree labellings",Utilitas Mathematica, 21: 31–48,
MR 0668845 (https://www.ams.org/mathscinet-getitem?mr=0668845).
55. Molloy, Michael; Reed, Bruce (1998), "A bound on the total chromatic number",Combinatorica, 18 (2): 241–280,
doi:10.1007/PL00009820 (https://doi.org/10.1007%2FPL00009820), MR 1656544 (https://www.ams.org/mathscinet-
getitem?mr=1656544).
56. Barát, János; Tóth, Géza (2010),"Towards the Albertson Conjecture"(http://www.combinatorics.org/Volume_17/Abst
racts/v17i1r73.html), Electronic Journal of Combinatorics, 17 (1): R73, arXiv:0909.0413 (https://arxiv.org/abs/0909.04
13) .
57. Wood, David (January 19, 2009),"Book Thickness of Subdivisions"(http://www.openproblemgarden.org/op/book_thi
ckness_of_subdivisions), Open Problem Garden, retrieved 2013-02-05.
58. Fulek, R.; Pach, J. (2011), "A computational approach to Conway's thrackle conjecture",
Computational Geometry,
44 (6–7): 345–355, doi:10.1007/978-3-642-18469-7_21(https://doi.org/10.1007%2F978-3-642-18469-7_21) ,
MR 2785903 (https://www.ams.org/mathscinet-getitem?mr=2785903).
59. Hartsfield, Nora; Ringel, Gerhard (2013), Pearls in Graph Theory: A Comprehensive Introduction(https://books.googl
e.com/books?id=VMjDAgAAQBAJ&pg=P A247), Dover Books on Mathematics, Courier Dover Publications, p. 247,
ISBN 978-0-486-31552-2, MR 2047103 (https://www.ams.org/mathscinet-getitem?mr=2047103).
60. Hliněný, Petr (2010), "20 years of Negami's planar cover conjecture"(http://www.fi.muni.cz/~hlineny/papers/plcover2
0-gc.pdf) (PDF), Graphs and Combinatorics, 26 (4): 525–536, doi:10.1007/s00373-010-0934-9(https://doi.org/10.10
07%2Fs00373-010-0934-9), MR 2669457 (https://www.ams.org/mathscinet-getitem?mr=2669457).
61. 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, doi:10.20382/jocg.v7i1a3 (https://doi.or
g/10.20382%2Fjocg.v7i1a3), MR 3463906 (https://www.ams.org/mathscinet-getitem?mr=3463906)
62. 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,152, American Mathematical
Society, pp. 126–127.
63. Demaine, E.; O'Rourke, J. (2002–2012), "Problem 45: Smallest Universal Set of Points for Planar Graphs",
The
Open Problems Project(http://cs.smith.edu/~orourke/TOPP/P45.html), retrieved 2013-03-19.
64. Chudnovsky, Maria (2014), "The Erdös–Hajnal conjecture—a survey"(http://www.columbia.edu/~mc2775/EHsurvey.
pdf) (PDF), Journal of Graph Theory, 75 (2): 178–190, arXiv:1606.08827 (https://arxiv.org/abs/1606.08827) ,
doi:10.1002/jgt.21730 (https://doi.org/10.1002%2Fjgt.21730), MR 3150572 (https://www.ams.org/mathscinet-getite
m?mr=3150572), Zbl 1280.05086 (https://zbmath.org/?format=complete&q=an:1280.05086) .
65. Spinrad, Jeremy P. (2003), "2. Implicit graph representation",Efficient Graph Representations(https://books.google.c
om/books?id=RrtXSKMAmWgC&pg=PA17), pp. 17–30, ISBN 0-8218-2815-0.
66. "Jorgensen's Conjecture"(http://www.openproblemgarden.org/op/jorgensens_conjecture), Open Problem Garden,
retrieved 2016-11-13.
67. Baird, William; Bonato, Anthony (2012), "Meyniel's conjecture on the cop number: a survey",Journal of
Combinatorics, 3 (2): 225–238, arXiv:1308.3385 (https://arxiv.org/abs/1308.3385) , doi:10.4310/JOC.2012.v3.n2.a6
(https://doi.org/10.4310%2FJOC.2012.v3.n2.a6) , MR 2980752 (https://www.ams.org/mathscinet-getitem?mr=298075
2)
68. 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 (https://arxiv.org/abs/1010.4430) , doi:10.1112/plms/pdq035 (https://doi.org/10.1112%2Fplms%2F
pdq035), MR 2793448 (https://www.ams.org/mathscinet-getitem?mr=2793448), Zbl 1218.05034 (https://zbmath.or
g/?format=complete&q=an:1218.05034).
69. 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 (https://doi.org/10.1002%2Fjgt.20565), MR 2864622 (https://www.ams.org/mathscinet-getite
m?mr=2864622).
70. Shelah S, Classification Theory, North-Holland, 1990
71. Keisler, HJ, "Ultraproducts which are not saturated." J. Symb Logic 32 (1967) 23—46.
72. Malliaris M, Shelah S, "A dividing line in simple unstable theories."https://arxiv.org/abs/1208.2140
73. Gurevich, Yuri, "Monadic Second-Order Theories," in J. Barwise, S. Feferman, eds., Model-Theoretic Logics(New
York: Springer-Verlag, 1985), 479–506.
74. Peretz, Assaf, "Geometry of forking in simple theories." Journal of Symbolic Logicolume
V 71, Issue 1 (2006), 347–
359.
75. Shelah, Saharon (1999). "Borel sets with large squares".Fundamenta Mathematicae. 159 (1): 1–50.
arXiv:math/9802134 (https://arxiv.org/abs/math/9802134) .
76. Shelah, Saharon (2009).Classification theory for abstract elementary classes
. College Publications.ISBN 978-1-
904987-71-0.
77. Makowsky J, "Compactness, embeddings and definability
," in Model-Theoretic Logics, eds Barwise and Feferman,
Springer 1985 pps. 645–715.
78. Baldwin, John T. (July 24, 2009). Categoricity (http://www.math.uic.edu/~jbaldwin/pub/AEClec.pdf) (PDF). American
Mathematical Society. ISBN 978-0-8218-4893-7. Retrieved February 20, 2014.
79. Shelah, Saharon. "Introduction to classification theory for abstract elementary classes"(http://front.math.ucdavis.ed
u/0903.3428).
80. Hrushovski, Ehud (1989). "Kueker's conjecture for stable theories".Journal of Symbolic Logic. 54 (1): 207–220.
doi:10.2307/2275025 (https://doi.org/10.2307%2F2275025).
81. Cherlin, G.; Shelah, S. (May 2007). "Universal graphs with a forbidden subtree".
Journal of Combinatorial Theory,
Series B. 97 (3): 293–333. arXiv:math/0512218 (https://arxiv.org/abs/math/0512218) .
doi:10.1016/j.jctb.2006.05.008(https://doi.org/10.1016%2Fj.jctb.2006.05.008).
82. Džamonja, Mirna, "Club guessing and the universal models."On PCF, ed. M. Foreman, (Banff, Alberta, 2004).
83. "Are the Digits of Pi Random? Berkeley Lab Researcher May Hold Key"
(http://www2.lbl.gov/Science-Articles/Archiv
e/pi-random.html).
84. https://arxiv.org/pdf/1604.07746v1.pdf
 85. Guo, Song; Sun, Zhi-Wei (2005), "On odd covering systems with distinct moduli",Advances in Applied Mathematics,
35 (2): 182–187, doi:10.1016/j.aam.2005.01.004(https://doi.org/10.1016%2Fj.aam.2005.01.004) , MR 2152886 (http
s://www.ams.org/mathscinet-getitem?mr=2152886)
86. Ribenboim, P. (2006). Die Welt der Primzahlen (https://books.google.com/books?id=XMyzh-2SClUC&lpg=PR5&dq=
die%20welt%20der%20primzahlen&hl=de&pg=P A242#v=snippet&q=die%20folgenden%20probleme%20sind%20un
gel%C3%B6st&f=false)(in German) (2nd ed.). Springer. pp. 242–243. doi:10.1007/978-3-642-18079-8(https://doi.or
g/10.1007%2F978-3-642-18079-8). ISBN 978-3-642-18078-1.
87. Dobson, J. B. (June 2012) [2011],On Lerch's formula for the Fermat quotient, p. 15, arXiv:1103.3907 (https://arxiv.or
g/abs/1103.3907)
88. Barros, Manuel (1997), "General Helices and a Theorem of Lancret",American Mathematical Society, 125: 1503–
1509, JSTOR 2162098 (https://www.jstor.org/stable/2162098)
89. Wolchover, Natalie (July 11, 2017),"Pentagon Tiling Proof Solves Century-Old Math Problem" (https://www.quantam
agazine.org/pentagon-tiling-proof-solves-century-old-math-problem-20170711/), Quanta Magazine
90. Lee, Choongbum (2017), "Ramsey numbers of degenerate graphs", Annals of Mathematics, 185 (3): 791–829,
doi:10.4007/annals.2017.185.3.2
91. Lamb, Evelyn (26 May 2016),"Two-hundred-terabyte maths proof is largest ever" (http://www.nature.com/news/two-
hundred-terabyte-maths-proof-is-largest-ever-1.19990) , Nature, 534: 17–18, doi:10.1038/nature.2016.19990(https://
doi.org/10.1038%2Fnature.2016.19990), PMID 27251254 (https://www.ncbi.nlm.nih.gov/pubmed/27251254); Heule,
Marijn J. H.; Kullmann, Oliver; Marek, Victor W. (2016), "Solving and verifying the Boolean Pythagorean triples
problem via cube-and-conquer",Theory and applications of satisfiability testing—SA T 2016, Lecture Notes in
Comput. Sci., 9710, Springer, [Cham], pp. 228–245,arXiv:1605.00723 (https://arxiv.org/abs/1605.00723) ,
doi:10.1007/978-3-319-40970-2_15(https://doi.org/10.1007%2F978-3-319-40970-2_15) , MR 3534782 (https://www.
ams.org/mathscinet-getitem?mr=3534782)
92. Abdollahi A., Zallaghi M. (2015)."Character sums for Cayley graphs"(http://www.tandfonline.com/doi/full/10.1080/00
927872.2014.967398). Communications in Algebra. 43 (12): 5159–5167. doi:10.1080/00927872.2014.967398(http
s://doi.org/10.1080%2F00927872.2014.967398) .
93. 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. doi:10.4007/annals.2016.184.2.7(https://doi.org/1
0.4007%2Fannals.2016.184.2.7).
94. https://arxiv.org/pdf/1509.05363v5.pdf
95. Duncan, John F. R.; Griffin, Michael J.; Ono, Ken (1 December 2015)."Proof of the umbral moonshine conjecture"(h
ttps://link.springer.com/article/10.1186/s40687-015-0044-7). Research in the Mathematical Sciences. 2 (1): 26.
doi:10.1186/s40687-015-0044-7(https://doi.org/10.1186%2Fs40687-015-0044-7)– via link.springer.com.
96. https://arxiv.org/pdf/1406.6534v10.pdf
97. "A Long-Sought Proof, Found and Almost Lost"(https://www.quantamagazine.org/20170328-statistician-proves-gaus
sian-correlation-inequality/). Quanta Magazine. Natalie Wolchover. March 28, 2017. Retrieved May 2, 2017.
98. Helfgott, Harald A. (2013). "Major arcs for Goldbach's theorem".arXiv:1305.2897 (https://arxiv.org/abs/1305.2897)
[math.NT (https://arxiv.org/archive/math.NT)].
99. Helfgott, Harald A. (2012). "Minor arcs for Goldbach's problem".arXiv:1205.5252 (https://arxiv.org/abs/1205.5252)
[math.NT (https://arxiv.org/archive/math.NT)].
100. Helfgott, Harald A. (2013). "The ternary Goldbach conjecture is true".arXiv:1312.7748 (https://arxiv.org/abs/1312.77
48) [math.NT (https://arxiv.org/archive/math.NT)].
101. Casazza, Peter G.; Fickus, Matthew; Tremain, Janet C.; Weber, Eric (2006). Han, Deguang; Jorgensen, Palle E. .T;
Larson, David Royal, eds."The Kadison-Singer problem in mathematics and engineering: A detailed account" (http
s://books.google.com/books?id=9b-4uqEGJdoC&pg=P A299). Contemporary Mathematics. Large Deviations for
Additive Functionals of Markov Chains: The 25th Great Plains Operator Theory Symposium, June 7–12, 2005,
University of Central Florida, Florida. American Mathematical Society
. 414: 299–355. doi:10.1090/conm/414/07820
(https://doi.org/10.1090%2Fconm%2F414%2F07820) . ISBN 978-0-8218-3923-2. Retrieved 24 April 2015.
102. Mackenzie, Dana. "Kadison–Singer Problem Solved"(https://www.siam.org/pdf/news/2123.pdf)(PDF). SIAM News
(January/February 2014).Society for Industrial and Applied Mathematics
. Retrieved 24 April 2015.
103. https://arxiv.org/pdf/1204.2810v1.pdf
104. http://www.math.jhu.edu/~js/Math646/brendle.lawson.pdf
105. Marques, Fernando C.; Neves, André (2013). "Min-max theory and the Willmore conjecture". Annals of Mathematics.
179: 683–782. arXiv:1202.6036 (https://arxiv.org/abs/1202.6036) . doi:10.4007/annals.2014.179.2.6(https://doi.org/
10.4007%2Fannals.2014.179.2.6).
106. https://arxiv.org/pdf/1101.1330v4.pdf
107. http://www.math.uiuc.edu/~mineyev/math/art/submult-shnc.pdf
108. http://annals.math.princeton.edu/wp-content/uploads/annals-v174-n1-p11-p.pdf
109. https://www.uni-due.de/~bm0032/publ/BlochKato.pdf
110. "page 359" (https://webusers.imj-prg.fr/~bruno.kahn/preprints/kcag.pdf)(PDF).
111. "motivic cohomology – Milnor–Bloch–Kato conjecture implies the Beilinson-Lichtenbaum conjecture – MathOverflow"
(http://mathoverflow.net/questions/87162/milnor-bloch-kato-conjecture-implies-the-beilinson-lichtenbaum-conjecture)
.
112. https://arxiv.org/pdf/1011.4105v3.pdf
113. https://www.researchgate.net/profile/Juan_Souto3/publication/228365532_Non-
realizability_and_ending_laminations_Proof_of_the_Density_Conjecture/links/541d85a10cf2218008d1d2e5.pdf
114. Santos, Franciscos (2012)."A counterexample to the Hirsch conjecture"(http://annals.math.princeton.edu/2012/176-
1/p07). Annals of Mathematics. Princeton University and Institute for Advanced Study
. 176 (1): 383–412.
doi:10.4007/annals.2012.176.1.7(https://doi.org/10.4007%2Fannals.2012.176.1.7) .
115. Ziegler, Günter M. (2012). "Who solved the Hirsch conjecture?"(http://www.math.uiuc.edu/documenta/vol-ismp/22_zi
egler-guenter.html). Documenta Mathematica. Extra Volume "Optimization Stories": 75–85.
116. "Generalized Sidon sets"(http://www.sciencedirect.com/science/article/pii/S0001870810001945). Advances in
Mathematics. 225: 2786–2807. doi:10.1016/j.aim.2010.05.010(https://doi.org/10.1016%2Fj.aim.2010.05.010) .
117. https://arxiv.org/pdf/0909.2360v3.pdf
118. https://arxiv.org/pdf/0906.1612v2.pdf
119. https://arxiv.org/pdf/0910.5501v5.pdf
120. http://www.csie.ntu.edu.tw/~hil/bib/ChalopinG09.pdf
121. Lurie, Jacob. "On the classification of topological field theories." Current developments in mathematics 2008 (2009):
129-280.
122. https://arxiv.org/pdf/0809.4040.pdf
123. "Prize for Resolution of the Poincaré Conjecture A warded to Dr. Grigoriy Perelman" (http://www.claymath.org/sites/d
efault/files/millenniumprizefull.pdf)(PDF) (Press release). Clay Mathematics Institute. March 18, 2010. Retrieved
November 13, 2015. "The Clay Mathematics Institute hereby awards the Millennium Prize for resolution of the
Poincaré conjecture to Grigoriy Perelman."
124. Khare, Chandrashekhar; Wintenberger, Jean-Pierre (2009), "Serre's modularity conjecture (I)",Inventiones
Mathematicae, 178 (3): 485–504, doi:10.1007/s00222-009-0205-7(https://doi.org/10.1007%2Fs00222-009-0205-7)
125. Khare, Chandrashekhar; Wintenberger, Jean-Pierre (2009), "Serre's modularity conjecture (II)",Inventiones
Mathematicae, 178 (3): 505–586, doi:10.1007/s00222-009-0206-6(https://doi.org/10.1007%2Fs00222-009-0206-6)
126. "2011 Cole Prize in Number Theory"(http://www.ams.org/notices/201104/rtx110400610p.pdf) (PDF). Notices of the
AMS. Providence, Rhode Island, United States: American Mathematical Society. 58 (4): 610–611. ISSN 1088-9477
(https://www.worldcat.org/issn/1088-9477). OCLC 34550461 (https://www.worldcat.org/oclc/34550461).
127. http://www.ww.amc12.org/sites/default/files/pdf/pubs/SquaringThePlane.pdf
128. https://arxiv.org/pdf/math/0509397.pdf
129. Seigel-Itzkovich, Judy (2008-02-08)."Russian immigrant solves math puzzle"(http://www.jpost.com/Home/Article.as
px?id=91431). The Jerusalem Post. Retrieved 2015-11-12.
130. http://homepages.warwick.ac.uk/~masgak/papers/bhb-angel.pdf
131. http://home.broadpark.no/~oddvark/angel/Angel.pdf
132. http://homepages.warwick.ac.uk/~masibe/angel-mathe.pdf
133. http://www.cs.bu.edu/~gacs/papers/angel.pdf
134. http://www.ams.org/journals/proc/2005-133-09/S0002-9939-05-07752-X/S0002-9939-05-07752-X.pdf
135. "Fields Medal – Ngô Bảo Châu" (http://www.icm2010.in/prize-winners-2010/fields-medal-ngo-bao-chau).
International Congress of Mathematicians 2010. ICM. 19 August 2010. Retrieved 2015-11-12. "Ngô Bảo Châu is
being awarded the 2010 Fields Medal for his proof of the Fundamental Lemma in the theory of automorphic forms
through the introduction of new algebro-geometric methods."
136. https://arxiv.org/pdf/math/0405568v1.pdf
137. "Graph Theory" (http://www.flooved.com/reader/3447#348).
138. Chung, Fan; Greene, Curtis; Hutchinson, Joan (April 2015)."Herbert S. Wilf (1931–2012)"(http://www.ams.org/notic
es/201504/rnoti-p346.pdf)(PDF). Notices of the AMS. Providence, Rhode Island, United States: American
Mathematical Society. 62 (4): 358. ISSN 1088-9477 (https://www.worldcat.org/issn/1088-9477). OCLC 34550461 (htt
ps://www.worldcat.org/oclc/34550461). "The conjecture was finally given an exceptionally elegant proof by A. Marcus
and G. Tardos in 2004."
139. "Bombieri and Tao Receive King Faisal Prize" (http://www.ams.org/notices/201005/rtx100500642p.pdf) (PDF).
Notices of the AMS. Providence, Rhode Island, United States: American Mathematical Society . 57 (5): 642–643.
May 2010. ISSN 1088-9477 (https://www.worldcat.org/issn/1088-9477). OCLC 34550461 (https://www.worldcat.org/o
clc/34550461). "Working with Ben Green, he proved there arearbitrarily long arithmetic progressions of prime
numbers—a result now known as the Green–T ao theorem."
140. https://arxiv.org/pdf/math/0412006v2.pdf
141. Connelly, Robert; Demaine, Erik D.; Rote, Günter (2003), "Straightening polygonal arcs and convexifying polygonal
cycles" (http://page.mi.fu-berlin.de/~rote/Papers/pdf/Straightening+polygonal+arcs+and+convexifying+polygonal+cyc
les-DCG.pdf) (PDF), Discrete and Computational Geometry, 30 (2): 205–239, doi:10.1007/s00454-003-0006-7(http
s://doi.org/10.1007%2Fs00454-003-0006-7), MR 1931840 (https://www.ams.org/mathscinet-getitem?mr=1931840)
142. Green, Ben (2004), "The Cameron–Erdős conjecture",The Bulletin of the London Mathematical Society
, 36 (6):
769–778, arXiv:math.NT/0304058 (https://arxiv.org/abs/math.NT/0304058) , doi:10.1112/S0024609304003650(http
s://doi.org/10.1112%2FS0024609304003650) , MR 2083752 (https://www.ams.org/mathscinet-getitem?mr=2083752)
143. "News from 2007" (http://www.ams.org/news?news_id=155). American Mathematical Society. AMS. 31 December
2007. Retrieved 2015-11-13. "The 2007 prize also recognizes Green for "his many outstanding results including his
resolution of the Cameron-Erdős conjecture..."
"
144. "Reduced power operations in motivic cohomology"(http://archive.numdam.org/ARCHIVE/PMIHES/PMIHES_2003_
_98_/PMIHES_2003__98__1_0/PMIHES_2003__98__1_0.pdf)(PDF). archive.numdam.org.
145. "Kemnitz' conjecture revisited"(http://www.sciencedirect.com/science/article/pii/S0012365X05002281). Discrete
Mathematics. 297: 196–201. doi:10.1016/j.disc.2005.02.018(https://doi.org/10.1016%2Fj.disc.2005.02.018) .
146. http://www.ams.org/journals/jams/2004-17-01/S0894-0347-03-00440-5/S0894-0347-03-00440-5.pdf
147. http://annals.math.princeton.edu/wp-content/uploads/annals-v158-n1-p04.pdf
148. "The strong perfect graph theorem"(http://annals.math.princeton.edu/2006/164-1/p02)
.
149. http://www.emis.de/journals/BAG/vol.43/no.1/b43h1haa.pdf
150. Knight, R. W. (2002), The Vaught Conjecture: A Counterexample, manuscript
151. http://www.ugr.es/~ritore/preprints/0406017.pdf
152. Metsänkylä, Tauno (5 September 2003)."Catalan's conjecture: another old diophantine problem solved"(http://www.
ams.org/journals/bull/2004-41-01/S0273-0979-03-00993-5/S0273-0979-03-00993-5.pdf) (PDF). Bulletin of the
American Mathematical Society. American Mathematical Society. 41 (1): 43–57. doi:10.1090/s0273-0979-03-00993-
5 (https://doi.org/10.1090%2Fs0273-0979-03-00993-5) . ISSN 0273-0979 (https://www.worldcat.org/issn/0273-0979).
"The conjecture, which dates back to 1844, was recently proven by the Swiss mathematician Preda Mihăilescu. "
153. http://www.ams.org/journals/jams/2001-14-04/S0894-0347-01-00373-3/S0894-0347-01-00373-3.pdf
154. http://junon.u-3mrs.fr/monniaux/AHLMT02.pdf
155. https://arxiv.org/pdf/math/0102150v4.pdf
156. Breuil, Christophe; Conrad, Brian; Diamond, Fred; aTylor, Richard (2001), "On the modularity of elliptic curves over
Q: wild 3-adic exercises",Journal of the American Mathematical Society , 14 (4): 843–939, doi:10.1090/S0894-0347-
01-00370-8 (https://doi.org/10.1090%2FS0894-0347-01-00370-8) , ISSN 0894-0347 (https://www.worldcat.org/issn/0
894-0347), MR 1839918 (https://www.ams.org/mathscinet-getitem?mr=1839918)
157. http://www.ams.org/journals/mcom/2001-70-234/S0025-5718-00-01178-9/S0025-5718-00-01178-9.pdf
158. http://intlpress.com/site/pub/files/_fulltext/journals/sdg/2002/0007/0001/SDG-2002-0007-0001-a001.pdf
159. Croot, Ernest S., III (2000), Unit Fractions, Ph.D. thesis, University of Georgia, Athens. Croot, Ernest S., III (2003),
"On a coloring conjecture about unit fractions",Annals of Mathematics, 157 (2): 545–556, arXiv:math.NT/0311421 (h
ttps://arxiv.org/abs/math.NT/0311421) , doi:10.4007/annals.2003.157.545(https://doi.org/10.4007%2Fannals.2003.
157.545)
160. https://arxiv.org/pdf/math/9906042v2.pdf
161. https://arxiv.org/pdf/math/9906212v2.pdf
162. Ullmo, E (1998). "Positivité et Discrétion des Points Algébriques des Courbes".
Annals of Mathematics. 147 (1):
167–179. doi:10.2307/120987 (https://doi.org/10.2307%2F120987). Zbl 0934.14013 (https://zbmath.org/?format=co
mplete&q=an:0934.14013).
163. Zhang, S.-W. (1998). "Equidistribution of small points on abelian varieties".Annals of Mathematics. 147 (1): 159–
165. doi:10.2307/120986 (https://doi.org/10.2307%2F120986).
164. Lafforgue, Laurent (1998),"Chtoucas de Drinfeld et applications"(http://www.math.uni-bielefeld.de/documenta/xvol-i
cm/07/Lafforgue.MAN.html) [Drinfelʹd shtukas and applications],Documenta Mathematica(in French), II: 563–570,
ISSN 1431-0635 (https://www.worldcat.org/issn/1431-0635), MR 1648105 (https://www.ams.org/mathscinet-getitem?
mr=1648105)
165. https://arxiv.org/pdf/1501.02155.pdf
166. https://arxiv.org/pdf/math/9811079v3.pdf
167. Norio Iwase (1 November 1998)."Ganea's Conjecture on Lusternik-Schnirelmann Category"(https://www.researchg
ate.net/publication/220032558_Ganea's_Conjecture_on_Lusternik-Schnirelmann_Category)
. ResearchGate.
168. Merel, Loïc (1996). "Bornes pour la torsion des courbes elliptiques sur les corps de nombres" [Bounds for the torsion
of elliptic curves over number fields]. Inventiones Mathematicae (in French) 124 (1): 437–449.
doi:10.1007/s002220050059(https://doi.org/10.1007%2Fs002220050059). MR1369424 (https://mathscinet.ams.org/
mathscinet-getitem?mr=1369424)
169. https://www.researchgate.net/profile/Zhibo_Chen/publication/220188021_Harary's_conjectures_on_integral_sum_graphs/lin
170. Wiles, Andrew (1995). "Modular elliptic curves and Fermat's Last Theorem"(http://math.stanford.edu/~lekheng/flt/wil
es.pdf) (PDF). Annals of Mathematics. Annals of Mathematics.141 (3): 443–551. doi:10.2307/2118559 (https://doi.or
g/10.2307%2F2118559). JSTOR 2118559 (https://www.jstor.org/stable/2118559). OCLC 37032255 (https://www.worl
dcat.org/oclc/37032255).
171. Taylor R, Wiles A (1995). "Ring theoretic properties of certain Hecke algebras"(https://web.archive.org/web/2005030
1000000*/http://www.math.harvard.edu/~rtaylor/hecke.ps). Annals of Mathematics. Annals of Mathematics.141 (3):
553–572. doi:10.2307/2118560 (https://doi.org/10.2307%2F2118560). JSTOR 2118560 (https://www.jstor.org/stable/
2118560). OCLC 37032255 (https://www.worldcat.org/oclc/37032255).

Further reading

Books discussing recently solved problems

Singh, Simon (2002). Fermat's Last Theorem. Fourth Estate. ISBN 1-84115-791-0.
O'Shea, Donal (2007).The Poincaré Conjecture. Penguin. ISBN 978-1-84614-012-9.
Szpiro, George G. (2003).Kepler's Conjecture. Wiley. ISBN 0-471-08601-0.
Ronan, Mark (2006). Symmetry and the Monster. Oxford. ISBN 0-19-280722-6.

Books discussing unsolved problems

Fan Chung; Graham, Ron (1999).Erdos on Graphs: His Legacy of Unsolved Problems . AK Peters. ISBN 1-56881-
111-X.
Croft, Hallard T.; Falconer, Kenneth J.; Guy, Richard K. (1994). Unsolved Problems in Geometry. Springer. ISBN 0-
387-97506-3.
Guy, Richard K. (2004). Unsolved Problems in Number Theory. Springer. ISBN 0-387-20860-7.
Klee, Victor; Wagon, Stan (1996). Old and New Unsolved Problems in Plane Geometry and Number Theory . The
Mathematical Association of America.ISBN 0-88385-315-9.
Du Sautoy, Marcus (2003). The Music of the Primes: Searching to Solve the Greatest Mystery in Mathematics .
Harper Collins. ISBN 0-06-093558-8.
Derbyshire, John (2003).Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics .
Joseph Henry Press. ISBN 0-309-08549-7.
Devlin, Keith (2006). The Millennium Problems – The Seven Greatest Unsolved* Mathematical Puzzles Of Ourime. T
Barnes & Noble. ISBN 978-0-7607-8659-8.
 Blondel, Vincent D.; Megrestski, Alexandre (2004). Unsolved problems in mathematical systems and control theory
.
Princeton University Press.ISBN 0-691-11748-9.
Lizhen Ji, [various]; Yat-Sun Poon, Shing-Tung Yau (2013). Open Problems and Surveys of Contemporary
Mathematics (volume 6 in the Surveys in Modern Mathematics series) (Surveys of Modern Mathematics) .
International Press of Boston.ISBN 1-57146-278-3.
Waldschmidt, Michel (2004). "Open Diophantine Problems"(PDF). Moscow Mathematical Journal. 4 (1): 245–305.
ISSN 1609-3321. Zbl 1066.11030.
Mazurov, V. D.; Khukhro, E. I. (1 Jun 2015). "Unsolved Problems in Group Theory
. The Kourovka Notebook. No. 18
(English version)". arXiv:1401.0300v6 .
Derbyshire, John (2003).Prime Obsession. The Joseph Henry Press.ISBN 0-309-08549-7.

External links
24 Unsolved Problems and Rewards for them
List of links to unsolved problems in mathematics, prizes and research
Open Problem GardenThe collection of open problems in mathematics build on the principle of user editable ("wiki")
site
AIM Problem Lists
Unsolved Problem of the Week Archive. MathPro Press.
Ball, John M. "Some Open Problems in Elasticity"(PDF).
Constantin, Peter. "Some open problems and research directions in the mathematical study of fluid dynamics"
(PDF).
Serre, Denis. "Five Open Problems in Compressible Mathematical Fluid Dynamics"(PDF).
Unsolved Problems in Number Theory, Logic and Cryptography
200 open problems in graph theory
The Open Problems Project (TOPP), discrete and computational geometry problems
Kirby's list of unsolved problems in low-dimensional topology
Erdös' Problems on Graphs
Unsolved Problems in Virtual Knot Theory and Combinatorial Knot Theory
Open problems from the 12th International Conference on Fuzzy Set Theory and Its Applications
List of open problems in inner model theory
Aizenman, Michael. "Open Problems in Mathematical Physics".
15 Problems in Mathematical Physics

Retrieved from "https://en.wikipedia.org/w/index.php?

title=List_of_unsolved_problems_in_mathematics&oldid=824163311
"

This page was last edited on 5 February 2018, at 18:10.

Text is available under theCreative Commons Attribution-ShareAlike License ; additional terms may apply. By using this
site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of theWikimedia
Foundation, Inc., a non-profit organization.