List of unsolved problems in mathematics

Short description: none

"Open problems in mathematics" redirects here. For the book, see Open Problems in Mathematics.

This is a dynamic list and may never be able to satisfy particular standards for completeness. You can help by expanding it with reliably sourced entries.

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.

## Contents

* 1 Notable lists
* 1.1 Millennium Prize Problems
* 1.2 Notebooks
* 2 Unsolved problems
* 2.1 Algebra
* 2.1.1 Group theory
* 2.1.2 Representation theory
* 2.2 Analysis
* 2.3 Combinatorics
* 2.4 Dynamical systems
* 2.5 Games and puzzles
* 2.5.1 Combinatorial games
* 2.5.2 Games with imperfect information
* 2.6 Geometry
* 2.6.1 Algebraic geometry
* 2.6.2 Covering and packing
* 2.6.3 Differential geometry
* 2.6.4 Discrete geometry
* 2.6.5 Euclidean geometry
* 2.6.6 Non-Euclidean geometry
* 2.7 Graph theory
* 2.7.1 Algebraic graph theory
* 2.7.2 Games on graphs
* 2.7.3 Graph coloring and labeling
* 2.7.4 Graph drawing and embedding
* 2.7.5 Restriction of graph parameters
* 2.7.6 Subgraphs
* 2.7.7 Word-representation of graphs
* 2.7.8 Miscellaneous graph theory
* 2.8 Model theory and formal languages
* 2.9 Probability theory
* 2.10 Number theory
* 2.10.1 General
* 2.10.2 Additive number theory
* 2.10.3 Algebraic number theory
* 2.10.4 Analytic number theory
* 2.10.5 Arithmetic geometry
* 2.10.6 Computational number theory
* 2.10.7 Diophantine approximation and transcendental number theory
* 2.10.8 Diophantine equations
* 2.10.9 Prime numbers
* 2.11 Set theory
* 2.12 Topology
* 3 Problems solved since 1995
* 3.1 Algebra
* 3.2 Analysis
* 3.3 Combinatorics
* 3.4 Dynamical systems
* 3.5 Game theory
* 3.6 Geometry
* 3.6.1 21st century
* 3.6.2 20th century
* 3.7 Graph theory
* 3.8 Group theory
* 3.9 Number theory
* 3.9.1 21st century
* 3.9.2 20th century
* 3.10 Ramsey theory
* 3.11 Theoretical computer science
* 3.12 Topology
* 3.13 Uncategorised
* 3.13.1 2010s
* 3.13.2 2000s
* 4 See also
* 5 Notes
* 6 References
* 7 Further reading
* 7.1 Books discussing problems solved since 1995
* 7.2 Books discussing unsolved problems
* 8 External links

## Notable lists

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.

List | Number of
problems | Number unsolved
or incompletely solved | Proposed by | Proposed

|
|
|
|

Thurston's 24 questions[1][2] | 24 | 2 | William Thurston | 1982
Smale's problems | 18 | 14 | Stephen Smale | 1998
Millennium Prize Problems | 7 | 6[3] | Clay Mathematics Institute | 2000
Simon problems | 15 | < 12[4][5] | Barry Simon | 2000
DARPA's math challenges[6][7] | 23 | – | DARPA | 2007
The Riemann zeta function, subject of the Riemann hypothesis[8]

### Millennium Prize Problems

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

* Birch and Swinnerton-Dyer conjecture
* Hodge conjecture
* Navier–Stokes existence and smoothness
* P versus NP
* Riemann hypothesis
* Yang–Mills existence and mass gap

The seventh problem, the Poincaré conjecture, was solved by Grigori Perelman in 2003.[9] 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.[10]

### Notebooks

* The Kourovka Notebook (Russian: Коуровская тетрадь) is a collection of unsolved problems in group theory, first published in 1965 and updated many times since.[11]
* The Sverdlovsk Notebook (Russian: Свердловская тетрадь) is a collection of unsolved problems in semigroup theory, first published in 1965 and updated every 2 to 4 years since.[12][13][14]
* The Dniester Notebook (Russian: Днестровская тетрадь) lists several hundred unsolved problems in algebra, particularly ring theory and modulus theory.[15][16]
* The Erlagol Notebook (Russian: Эрлагольская тетрадь) lists unsolved problems in algebra and model theory.[17]

## Unsolved problems

### Algebra

Main article: Algebra

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.

* Birch–Tate conjecture on the relation between the order of the center of the Steinberg group of the ring of integers of a number field to the field's Dedekind zeta function.
* Casas-Alvero conjecture: if a polynomial of degree d defined over a field K of characteristic 0 has a factor in common with its first through d−1-th derivative, then must f be the d-th power of a linear polynomial?
* Connes embedding problem in Von Neumann algebra theory
* Crouzeix's conjecture: the matrix norm of a complex function f applied to a complex matrix A is at most twice the supremum of |f(z)| over the field of values of A.
* Determinantal conjecture on the determinant of the sum of two normal matrices.
* Eilenberg–Ganea conjecture: a group with cohomological dimension 2 also has a 2-dimensional Eilenberg–MacLane space K(G,1).
* Farrell–Jones conjecture on whether certain assembly maps are isomorphisms.
* Bost conjecture: a specific case of the Farrell–Jones conjecture
* Finite lattice representation problem: is every finite lattice isomorphic to the congruence lattice of some finite algebra?[18]
* Goncharov conjecture on the cohomology of certain motivic complexes.
* Green's conjecture: the Clifford index of a non-hyperelliptic curve is determined by the extent to which it, as a canonical curve, has linear syzygies.
* Grothendieck–Katz p-curvature conjecture: a conjectured local–global principle for linear ordinary differential equations.
* Hadamard conjecture: for every positive integer k, a Hadamard matrix of order 4k exists.
* Williamson conjecture: the problem of finding Williamson matrices, which can be used to construct Hadamard matrices.
* Ryser's conjecture on circulant Hadamard matrices: no real circulant Hadamard matrix has order greater than 4.
* Hadamard's maximal determinant problem: what is the largest determinant of a matrix with entries all equal to 1 or −1?
* Hilbert's fifteenth problem: put Schubert calculus on a rigorous foundation.
* Hilbert's sixteenth problem: what are the possible configurations of the connected components of M-curves?
* Homological conjectures in commutative algebra
* Jacobson's conjecture: the intersection of all powers of the Jacobson radical of a left-and-right Noetherian ring is precisely 0.
* Kaplansky's conjectures
* Köthe conjecture: if a ring has no nil ideal other than {0}, then it has no nil one-sided ideal other than {0}.
* Monomial conjecture on Noetherian local rings
* Existence of perfect cuboids and associated cuboid conjectures
* Pierce–Birkhoff conjecture: every piecewise-polynomial f:ℝn->ℝ is the maximum of a finite set of minimums of finite collections of polynomials.
* Rota's basis conjecture: for matroids of rank n with n disjoint bases Bi, it is possible to create an n×n matrix whose rows are Bi and whose columns are also bases.
* Serre's conjecture II: if G is a simply connected semisimple algebraic group over a perfect field of cohomological dimension at most 2, then the Galois cohomology set H1(F,G) is zero.
* Serre's positivity conjecture that if R is a commutative regular local ring, and P,Q are prime ideals of R, then dim⁡(R/P)+dim⁡(R/Q)=dim⁡(R) implies χ(R/P,R/Q)>0.
* Uniform boundedness conjecture for rational points: do algebraic curves of genus g≥2 over number fields K have at most some bounded number N(K,g) of K-rational points?
* Wild problems: problems involving classification of pairs of n×n matrices under simultaneous conjugation.
* Zariski–Lipman conjecture: for a complex algebraic variety V with coordinate ring R, if the derivations of R are a free module over R, then V is smooth.
* Zauner's conjecture: do SIC-POVMs exist in all dimensions?

#### Group theory

Main article: Group theory

The free Burnside group 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) are finite remains open.

* Andrews–Curtis conjecture: every balanced presentation of the trivial group can be transformed into a trivial presentation by a sequence of Nielsen transformations on relators and conjugations of relators
* Bounded Burnside problem: for which positive integers m, n is the free Burnside group B(m,n) finite? In particular, is B(2, 5) finite?
* Guralnick–Thompson conjecture on the composition factors of groups in genus-0 systems[19]
* Herzog–Schönheim conjecture: if a finite system of left cosets of subgroups of a group G form a partition of G, then the finite indices of said subgroups cannot be distinct.
* The inverse Galois problem: is every finite group the Galois group of a Galois extension of the rationals?
* Isomorphism problem of Coxeter groups
* Are there an infinite number of Leinster groups?
* Does generalized moonshine exist?
* Is every finitely presented periodic group finite?
* Is every group surjunctive?
* Problems in loop theory and quasigroup theory consider generalizations of groups

#### Representation theory

* Arthur's conjectures
* Dade's conjecture relating the numbers of characters of blocks of a finite group to the numbers of characters of blocks of local subgroups.
* Demazure conjecture on representations of algebraic groups over the integers.
* Kazhdan–Lusztig conjectures relating the values of the Kazhdan–Lusztig polynomials at 1 with representations of complex semisimple Lie groups and Lie algebras.
* McKay conjecture: in a group G, the number of irreducible complex characters of degree not divisible by a prime number p is equal to the number of irreducible complex characters of the normalizer of any Sylow p-subgroup within G.

### Analysis

Main article: Mathematical analysis

* The Brennan conjecture: estimating the integral powers of the moduli of the derivative of conformal maps into the open unit disk, on certain subsets of ℂ
* Fuglede's conjecture on whether nonconvex sets in ℝ and ℝ2 are spectral if and only if they tile by translation.
* Goodman's conjecture on the coefficients of multivalued functions
* Invariant subspace problem – does every bounded operator on a complex Banach space send some non-trivial closed subspace to itself?
* Kung–Traub conjecture on the optimal order of a multipoint iteration without memory[20]
* Lehmer's conjecture on the Mahler measure of non-cyclotomic polynomials[21]
* The mean value problem: given a complex polynomial f of degree d≥2 and a complex number z, is there a critical point c of f such that |f(z)−f(c)|≤|f′(z)||z−c|?
* The Pompeiu problem on the topology of domains for which some nonzero function has integrals that vanish over every congruent copy[22]
* Sendov's conjecture: if a complex polynomial with degree at least 2 has all roots in the closed unit disk, then each root is within distance 1 from some critical point.
* Vitushkin's conjecture on compact subsets of ℂ with analytic capacity 0
* What is the exact value of Landau's constants, including Bloch's constant?
* Regularity of solutions of Euler equations
* Convergence of Flint Hills series
* Regularity of solutions of Vlasov–Maxwell equations
* Are there infinitely many Lehmer pairs?[23]

### Combinatorics

Main article: Combinatorics

* 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 that x appears before y in a random linear extension is between 1/3 and 2/3?[24]
* The Dittert conjecture concerning the maximum achieved by a particular function of matrices with real, nonnegative entries satisfying a summation condition
* Problems in Latin squares – open questions concerning Latin squares
* The lonely runner conjecture – if k runners with pairwise distinct speeds run round a track of unit length, will every runner be "lonely" (that is, be at least a distance 1/k from each other runner) at some time?[25]
* Superpermutations \- smallest possible string of n digits that contains all possible permutations of n
* Map folding – various problems in map folding and stamp folding.
* No-three-in-line problem – how many points can be placed in the n×n grid so that no three of them lie on a line?
* Rudin's conjecture on the number of squares in finite arithmetic progressions[26]
* The sunflower conjecture – can the number of k size sets required for the existence of a sunflower of r sets be bounded by an exponential function in k for every fixed r>2?
* 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[27]

* Give a combinatorial interpretation of the Kronecker coefficients[28]
* The size m(n) of the smallest collection of n-uniform sets without Property B for n≥5
* The values of the Dedekind numbers M(n) for n≥10[29]
* The values of the Ramsey numbers, particularly R(5,5)
* The values of the Van der Waerden numbers
* Finding a function to model n-step self-avoiding walks[30]

### Dynamical systems

Main article: Dynamical system

A detail of the Mandelbrot set. It is not known whether the Mandelbrot set is locally connected or not.

* Arnold–Givental conjecture and Arnold conjecture – relating symplectic geometry to Morse theory.
* Berry–Tabor conjecture in quantum chaos
* Banach's problem – is there an ergodic system with simple Lebesgue spectrum?[31]
* Birkhoff conjecture – if a billiard table is strictly convex and integrable, is its boundary necessarily an ellipse?[32]
* Collatz conjecture (also known as the 3n+1 conjecture)
* Eden's conjecture that the supremum of the local Lyapunov dimensions on the global attractor is achieved on a stationary point or an unstable periodic orbit embedded into the attractor.
* Fatou conjecture that a quadratic family of maps from the complex plane to itself is hyperbolic for an open dense set of parameters.
* Furstenberg conjecture – is every invariant and ergodic measure for the ×2,×3 action on the circle either Lebesgue or atomic?
* Kaplan–Yorke conjecture on the dimension of an attractor in terms of its Lyapunov exponents
* Margulis conjecture – measure classification for diagonalizable actions in higher-rank groups.
* Hilbert–Arnold problem – is there a uniform bound on limit cycles in generic finite-parameter families of vector fields on a sphere?
* MLC conjecture – is the Mandelbrot set locally connected?
* Many problems concerning an outer billiard, for example showing that outer billiards relative to almost every convex polygon have unbounded orbits.
* Quantum unique ergodicity conjecture on the distribution of large-frequency eigenfunctions of the Laplacian on a negatively-curved manifold[33]
* Rokhlin's multiple mixing problem – are all strongly mixing systems also strongly 3-mixing?[34]
* Triangular billiards – does every triangle have a periodic billiards path?[35]
* Weinstein conjecture – does a regular compact contact type level set of a Hamiltonian on a symplectic manifold carry at least one periodic orbit of the Hamiltonian flow?
* Does every positive integer generate a juggler sequence terminating at 1?
* Lyapunov function: Lyapunov's second method for stability – For what classes of ODEs, describing dynamical systems, does Lyapunov's second method, formulated in the classical and canonically generalized forms, define the necessary and sufficient conditions for the (asymptotical) stability of motion?
* Is every reversible cellular automaton in three or more dimensions locally reversible?[36]

### Games and puzzles

Main article: Game theory

#### Combinatorial games

Main article: Combinatorial game theory

* Sudoku:
* How many puzzles have exactly one solution?[37]
* How many puzzles with exactly one solution are minimal?[37]
* What is the maximum number of givens for a minimal puzzle?[37]
* Tic-tac-toe variants:
* Given the width of a tic-tac-toe board, what is the smallest dimension such that X is guaranteed to have a winning strategy? (See also Hales–Jewett theorem and nd game)[38]
* Chess:
* What is the outcome of a perfectly played game of chess? (See also first-move advantage in chess)
* Go:
* What is the perfect value of Komi?
* Set:
* What is the largest possible cap set, as a function of n in the n-dimensional affine space over the three-element field?[39]
* Are the nim-sequences of all finite octal games eventually periodic?
* Is the nim-sequence of Grundy's game eventually periodic?

#### Games with imperfect information

* Rendezvous problem

### Geometry

Main article: Geometry

#### Algebraic geometry

Main article: Algebraic geometry

* Abundance conjecture: if the canonical bundle of a projective variety with Kawamata log terminal singularities is nef, then it is semiample.
* Bass conjecture on the finite generation of certain algebraic K-groups.
* Bass–Quillen conjecture relating vector bundles over a regular Noetherian ring and over the polynomial ring A[t1,…,tn].
* Deligne conjecture: any one of numerous named for Pierre Deligne.
* Deligne's conjecture on Hochschild cohomology about the operadic structure on Hochschild cochain complex.
* Dixmier conjecture: any endomorphism of the Weyl algebras A1 and A2 is an automorphism.
* Fröberg conjecture on the Hilbert functions of a set of forms.
* Fujita conjecture regarding the line bundle KM⊗L⊗m constructed from a positive holomorphic line bundle L on a compact complex manifold M and the canonical line bundle KM of M
* General elephant problem: do general elephants have at most Du Val singularities?
* Hartshorne's conjectures[40]
* In spherical or hyperbolic geometry, must polyhedra with the same volume and Dehn invariant be scissors-congruent?[41]
* Jacobian conjecture for two-dimensional spaces: if a two-dimensional polynomial mapping over a characteristic-0 field has a constant nonzero Jacobian determinant, then does it have a regular (i.e. with polynomial components) inverse function?
* Maulik–Nekrasov–Okounkov–Pandharipande conjecture on an equivalence between Gromov–Witten theory and Donaldson–Thomas theory[42]
* Nagata's conjecture on curves, specifically the minimal degree required for a plane algebraic curve to pass through a collection of very general points with prescribed multiplicities.
* Nagata–Biran conjecture that if X is a smooth algebraic surface and L is an ample line bundle on X of degree d, then for sufficiently large r, the Seshadri constant satisfies ε(p1,…,pr;X,L)=d/r.
* Nakai conjecture: if a complex algebraic variety has a ring of differential operators generated by its contained derivations, then it must be smooth.
* Parshin's conjecture: the higher algebraic K-groups of any smooth projective variety defined over a finite field must vanish up to torsion.
* Section conjecture on splittings of group homomorphisms from fundamental groups of complete smooth curves over finitely-generated fields k to the Galois group of k.
* Standard conjectures on algebraic cycles
* Tate conjecture on the connection between algebraic cycles on algebraic varieties and Galois representations on étale cohomology groups.
* Virasoro conjecture: a certain generating function encoding the Gromov–Witten invariants of a smooth projective variety is fixed by an action of half of the Virasoro algebra.
* Zariski multiplicity conjecture on the topological equisingularity and equimultiplicity of varieties at singular points[43]
* Are infinite sequences of flips possible in dimensions greater than 3?
* Resolution of singularities in characteristic p

#### Covering and packing

* Borsuk's problem on upper and lower bounds for the number of smaller-diameter subsets needed to cover a bounded n-dimensional set.
* The covering problem of Rado: if the union of finitely many axis-parallel squares has unit area, how small can the largest area covered by a disjoint subset of squares be?[44]
* The Erdős–Oler conjecture: when n is a triangular number, packing n−1 circles in an equilateral triangle requires a triangle of the same size as packing n circles.[45]
* The disk covering problem about finding the smallest real number r(n) such that n disks of radius r(n) can be arranged in such a way as to cover the unit disk.
* The kissing number problem for dimensions other than 1, 2, 3, 4, 8 and 24[46]
* Reinhardt's conjecture: the smoothed octagon has the lowest maximum packing density of all centrally-symmetric convex plane sets[47]
* Sphere packing problems, including the density of the densest packing in dimensions other than 1, 2, 3, 8 and 24, and its asymptotic behavior for high dimensions.
* Square packing in a square: what is the asymptotic growth rate of wasted space?[48]
* Ulam's packing conjecture about the identity of the worst-packing convex solid[49]
* The Tammes problem for numbers of nodes greater than 14 (except 24).[50]

#### Differential geometry

Main article: Differential geometry

* The spherical Bernstein's problem, a generalization of Bernstein's problem
* Carathéodory conjecture: any convex, closed, and twice-differentiable surface in three-dimensional Euclidean space admits at least two umbilical points.
* Cartan–Hadamard conjecture: can the classical isoperimetric inequality for subsets of Euclidean space be extended to spaces of nonpositive curvature, known as Cartan–Hadamard manifolds?
* Chern's conjecture (affine geometry) that the Euler characteristic of a compact affine manifold vanishes.
* Chern's conjecture for hypersurfaces in spheres, a number of closely related conjectures.
* Closed curve problem: find (explicit) necessary and sufficient conditions that determine when, given two periodic functions with the same period, the integral curve is closed.[51]
* The filling area conjecture, that a hemisphere has the minimum area among shortcut-free surfaces in Euclidean space whose boundary forms a closed curve of given length[52]
* The Hopf conjectures relating the curvature and Euler characteristic of higher-dimensional Riemannian manifolds[53]
* Osserman conjecture: that every Osserman manifold is either flat or locally isometric to a rank-one symmetric space[54]
* Yau's conjecture on the first eigenvalue that the first eigenvalue for the Laplace–Beltrami operator on an embedded minimal hypersurface of Sn+1 is n.

#### Discrete geometry

Main article: Discrete geometry

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.

* The big-line-big-clique conjecture on the existence of either many collinear points or many mutually visible points in large planar point sets[55]
* The Dirac–Motzkin conjecture on the minimum number of ordinary lines for n points in the Euclidean plane[56]
* The Hadwiger conjecture on covering n-dimensional convex bodies with at most 2n smaller copies[57]
* Solving the happy ending problem for arbitrary n[58]
* Improving lower and upper bounds for the Heilbronn triangle problem.
* Kalai's 3d conjecture on the least possible number of faces of centrally symmetric polytopes.[59]
* The Kobon triangle problem on triangles in line arrangements[60]
* The Kusner conjecture: at most 2d points can be equidistant in L1 spaces[61]
* The McMullen problem on projectively transforming sets of points into convex position[62]
* Opaque forest problem on finding opaque sets for various planar shapes
* Orchard-planting problem on the maximum number of 3-point lines attainable by a configuration of n points in the plane[63]
* How many unit distances can be determined by a set of n points in the Euclidean plane?[64]
* Finding matching upper and lower bounds for k-sets and halving lines[65]
* For each arrangement of points in which the rectilinear crossing number is minimized, is the number of halving lines maximized?[66]
* Tripod packing:[67] how many tripods can have their apexes packed into a given cube?

#### Euclidean geometry

Main article: Euclidean geometry

* The Atiyah conjecture on configurations on the invertibility of a certain n-by-n matrix depending on n points in ℝ3[68]
* Bellman's lost-in-a-forest problem – find the shortest route that is guaranteed to reach the boundary of a given shape, starting at an unknown point of the shape with unknown orientation[69]
* Borromean rings — are there three unknotted space curves, not all three circles, which cannot be arranged to form this link?[70]
* Connelly’s blooming conjecture: Does every net of a convex polyhedron have a blooming?[71]
* Danzer's problem and Conway's dead fly problem – do Danzer sets of bounded density or bounded separation exist?[72]
* Dissection into orthoschemes – is it possible for simplices of every dimension?[73]
* Ehrhart's volume conjecture: a convex body K in n dimensions containing a single lattice point in its interior as its center of mass cannot have volume greater than (n+1)n/n!
* Falconer's conjecture: sets of Hausdorff dimension greater than d/2 in ℝd must have a distance set of nonzero Lebesgue measure[74]
* The values of the Hermite constants for dimensions other than 1–8 and 24
* What is the lowest number of faces possible for a holyhedron?
* Inscribed square problem, also known as Toeplitz' conjecture and the square peg problem – does every Jordan curve have an inscribed square?[75]
* The Kakeya conjecture – do n-dimensional sets that contain a unit line segment in every direction necessarily have Hausdorff dimension and Minkowski dimension equal to n?[76]
* The Kelvin problem on minimum-surface-area partitions of space into equal-volume cells, and the optimality of the Weaire–Phelan structure as a solution to the Kelvin problem[77]
* Lebesgue's universal covering problem on the minimum-area convex shape in the plane that can cover any shape of diameter one[78]
* Mahler's conjecture on the product of the volumes of a centrally symmetric convex body and its polar.[79]
* In Meissner body):

* Are the two Meissner tetrahedra the minimum-volume three-dimensional shapes of constant width?[80]

* Moser's worm problem – what is the smallest area of a shape that can cover every unit-length curve in the plane?[81]
* The moving sofa problem – what is the largest area of a shape that can be maneuvered through a unit-width L-shaped corridor?[82]
* In parallelohedron:
* Can every spherical non-convex polyhedron that tiles space by translation have its faces grouped into patches with the same combinatorial structure as a parallelohedron?[83]
* Does every higher-dimensional tiling by translations of convex polytope tiles have an affine transformation taking it to a Voronoi diagram?[84]
* Ropelength problems:
* Is there a general expression for the minimum ropelength of an arbitrary closed knot?
* What constant 1.1<a≤10.76 governs the lower bound of a closed knot K's minimum ropelength L(K)≥aCr⁡(K)3/4?
* Is the upper bound of a closed knot's minimum ropelength linear to its crossing number?
* Is there a general expression for how much the ends of a long rope of radius 1 get closer when a tight open knot is tied into it?
* Does every convex polyhedron have Rupert's property?[85][86][lower-alpha 1]
* Shephard's problem (a.k.a. Dürer's conjecture) – does every convex polyhedron have a net, or simple edge-unfolding?[88][89]
* Is there a non-convex polyhedron without self-intersections with more than seven faces, all of which share an edge with each other?
* The Thomson problem – what is the minimum energy configuration of n mutually-repelling particles on a unit sphere?[90]
* Convex uniform 5-polytopes – find and classify the complete set of these shapes[91]

#### Non-Euclidean geometry

Main article: Non-Euclidean geometry

* Hilbert's third problem for non-Euclidean geometries: in spherical or hyperbolic geometry, must polyhedra with the same volume and Dehn invariant be scissors-congruent?

### Graph theory

Main article: Graph theory

#### Algebraic graph theory

* Babai's problem: which groups are Babai invariant groups?
* Brouwer's conjecture on upper bounds for sums of eigenvalues of Laplacians of graphs in terms of their number of edges

#### Games on graphs

* γ–θ conjecture: Does there exist a graph G such that the dominating number, eternal domination number, and clique covering number satisfy γ(G)=γ∞(G)<θ(G)?[92][93]
* Graham's pebbling conjecture on the pebbling number of Cartesian products of graphs[94]
* Meyniel's conjecture that cop number is O(n)[95]
* Suppose Alice has a winning strategy for the vertex coloring game on a graph G with k colors. Does she have one for k+1 colors?[96]

#### Graph coloring and labeling

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.

* The 1-factorization conjecture that if n is odd or even and k≥n,n−1, respectively, then a k-regular graph with 2n vertices is 1-factorable.
* The perfect 1-factorization conjecture that every complete graph on an even number of vertices admits a perfect 1-factorization.
* Cereceda's conjecture on the diameter of the space of colorings of degenerate graphs[97]
* The Earth–Moon problem: what is the maximum chromatic number of biplanar graphs?[98]
* The Erdős–Faber–Lovász conjecture on coloring unions of cliques[99]
* The graceful tree conjecture that every tree admits a graceful labeling
* Rosa's conjecture that all triangular cacti are graceful or nearly-graceful
* The Gyárfás–Sumner conjecture on χ-boundedness of graphs with a forbidden induced tree[100]
* The Hadwiger conjecture relating coloring to clique minors[101]
* The Hadwiger–Nelson problem on the chromatic number of unit distance graphs[102]
* Jaeger's Petersen-coloring conjecture: every bridgeless cubic graph has a cycle-continuous mapping to the Petersen graph[103]
* The list coloring conjecture: for every graph, the list chromatic index equals the chromatic index[104]
* The overfull conjecture that a graph with maximum degree Δ(G)≥n/3 is class 2 if and only if it has an overfull subgraph S satisfying Δ(S)=Δ(G).
* The total coloring conjecture of Behzad and Vizing that the total chromatic number is at most two plus the maximum degree[105]

#### Graph drawing and embedding

* The Albertson conjecture: the crossing number can be lower-bounded by the crossing number of a complete graph with the same chromatic number[106]
* Conway's thrackle conjecture[107] that thrackles cannot have more edges than vertices
* The GNRS conjecture on whether minor-closed graph families have ℓ1 embeddings with bounded distortion[108]
* Harborth's conjecture: every planar graph can be drawn with integer edge lengths[109]
* Negami's conjecture on projective-plane embeddings of graphs with planar covers[110]
* The strong Papadimitriou–Ratajczak conjecture: every polyhedral graph has a convex greedy embedding[111]
* Turán's brick factory problem – Is there a drawing of any complete bipartite graph with fewer crossings than the number given by Zarankiewicz?[112]
* Guy's conjecture on the crossing number for complete graphs – Is there a drawing of any complete graph with fewer crossings than the number given by his upper bound?[113]
* Universal point sets of subquadratic size for planar graphs[114]

#### Restriction of graph parameters

* Does there exist a conference graph for every number of vertices v>1 where v≡1mod4 and v is an odd sum of two squares?[115]
* Conway's 99-graph problem: does there exist a strongly regular graph with parameters (99,14,1,2)?[116]
* Degree diameter problem: given two positive integers d,k, what is the largest graph of diameter k such that all vertices have degrees at most d?
* Jørgensen's conjecture that every 6-vertex-connected K6-minor-free graph is an apex graph[117]
* Does a Moore graph with girth 5 and degree 57 exist?[118]
* Do there exist infinitely many strongly regular geodetic graphs, or any strongly regular geodetic graphs that are not Moore graphs?[119]

#### Subgraphs

* Barnette's conjecture: every cubic bipartite three-connected planar graph has a Hamiltonian cycle[120]
* Gilbert–Pollak conjecture on the Steiner ratio of the Euclidean plane that the Steiner ratio is 3/2
* Chvátal's toughness conjecture, that there is a number t such that every t-tough graph is Hamiltonian[121]
* The cycle double cover conjecture: every bridgeless graph has a family of cycles that includes each edge twice[122]
* The Erdős–Gyárfás conjecture on cycles with power-of-two lengths in cubic graphs[123]
* The Erdős–Hajnal conjecture on large cliques or independent sets in graphs with a forbidden induced subgraph[124]
* The Grünbaum–Nash-Williams conjecture on whether every 4-vertex-connected toroidal graph has a Hamiltonian cycle.[125]
* The linear arboricity conjecture on decomposing graphs into disjoint unions of paths according to their maximum degree[126]
* The Lovász conjecture on Hamiltonian paths in symmetric graphs[127]
* The Oberwolfach problem on which 2-regular graphs have the property that a complete graph on the same number of vertices can be decomposed into edge-disjoint copies of the given graph.[128]
* What is the largest possible pathwidth of an n-vertex cubic graph?[129]
* The reconstruction conjecture and new digraph reconstruction conjecture on whether a graph is uniquely determined by its vertex-deleted subgraphs.[130][131]
* The snake-in-the-box problem: what is the longest possible induced path in an n-dimensional hypercube graph?
* Sumner's conjecture: does every (2n−2)-vertex tournament contain as a subgraph every n-vertex oriented tree?[132]
* Szymanski's conjecture: every permutation on the n-dimensional doubly-directed hypercube graph can be routed with edge-disjoint paths.
* Tuza's conjecture: if the maximum number of disjoint triangles is ν, can all triangles be hit by a set of at most 2ν edges?[133]
* The unfriendly partition conjecture: Does every countable graph have an unfriendly partition into two parts?[134]
* Vizing's conjecture on the domination number of cartesian products of graphs[135]
* Walescki's theorem for hypergraphs: Do complete k-uniform hypergraphs admit Hamiltonian decompositions into tight cycles?[136]
* Zarankiewicz problem: how many edges can there be in a bipartite graph on a given number of vertices with no complete bipartite subgraphs of a given size?

#### Word-representation of graphs

* Are there any graphs on n vertices whose representation requires more than floor(n/2) copies of each letter?[137][138][139][140]
* Characterise (non-)word-representable planar graphs[137][138][139][140]
* Characterise word-representable graphs in terms of (induced) forbidden subgraphs.[137][138][139][140]
* Characterise word-representable near-triangulations containing the complete graph K4 (such a characterisation is known for K4-free planar graphs[141])
* Classify graphs with representation number 3, that is, graphs that can be represented using 3 copies of each letter, but cannot be represented using 2 copies of each letter[142]
* Is it true that out of all bipartite graphs, crown graphs require longest word-representants?[143]
* Is the line graph of a non-word-representable graph always non-word-representable?[137][138][139][140]
* Which (hard) problems on graphs can be translated to words representing them and solved on words (efficiently)?[137][138][139][140]

#### Miscellaneous graph theory

* Delta-conjecture (1978): consider a complete graph (V;E1,…,Ed) each edge of which is colored by one of d colors such that there exists a triangle Δ colored in three pairwise distinct colors. Then, in each chromatic component (V,Ei),i=1,…,d, one can choose a maximal independent vertex-set such that the intersection of the obtained d sets is empty.[144][145]
* The imbalance conjecture: If the imbalance for each edge of a graph is at least 1, is the multiset of all edge imbalances always graphic?[146]
* The implicit graph conjecture on the existence of implicit representations for slowly-growing hereditary families of graphs[147]
* Ryser's conjecture relating the maximum matching size and minimum transversal size in hypergraphs
* The second neighborhood problem: does every oriented graph contain a vertex for which there are at least as many other vertices at distance two as at distance one?[148]
* Sidorenko's conjecture on homomorphism densities of graphs in graphons
* Teschner's bondage number conjecture: is the bondage number of a graph always less than or equal to 3/2 times its maximum degree?[149]
* Tutte's conjectures:
* every bridgeless graph has a nowhere-zero 5-flow[150]
* every Petersen-minor-free bridgeless graph has a nowhere-zero 4-flow[151]
* Woodall's conjecture that the minimum number of edges in a dicut of a directed graph is equal to the maximum number of disjoint dijoins.

### Model theory and formal languages

Main articles: Model theory and formal languages

* The Cherlin–Zilber conjecture: A simple group whose first-order theory is stable in ℵ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[152]
* The main gap conjecture, e.g. for uncountable first order theories, for AECs, and for ℵ1-saturated models of a countable theory.[153]
* Shelah's categoricity conjecture for Lω1,ω: If a sentence is categorical above the Hanf number then it is categorical in all cardinals above the Hanf number.[153]
* Shelah's eventual categoricity 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 μ(λ).[153][154]
* The stable field conjecture: every infinite field with a stable first-order theory is separably closed.
* The stable forking conjecture for simple theories[155]
* 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?[156]
* The universality spectrum problem: Is there a first-order theory whose universality spectrum is minimum?[157]
* Vaught conjecture: the number of countable models of a first-order complete theory in a countable language is either finite, ℵ0, or 2ℵ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 does it have a model of cardinality continuum?[158]
* 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, is it categorical in every cardinal?[159][160]
* 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?[161]
* Is the theory of the field of Laurent series over ℤp decidable? of the field of polynomials over ℂ?
* Is there a logic L which satisfies both the Beth property and Δ-interpolation, is compact but does not satisfy the interpolation property?[162]
* Determine the structure of Keisler's order.[163][164]
* 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?[165]

### Probability theory

Main article: Probability theory

* Ibragimov–Iosifescu conjecture for φ-mixing sequences

### Number theory

See also: Number theory

#### General

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.

* Büchi's problem on sufficiently large sequences of square numbers with constant second difference.
* Carmichael's totient function conjecture: do all values of Euler's totient function have multiplicity greater than 1?
* Catalan–Dickson conjecture on aliquot sequences: no aliquot sequences are infinite but non-repeating.
* Exponent pair conjecture: for all ε>0, is the pair (ε,1/2+ε) an exponent pair?
* 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?
* Grimm's conjecture: each element of a set of consecutive composite numbers can be assigned a distinct prime number that divides it.
* Hall's conjecture: for any ε>0, there is some constant c(ε) such that either y2=x3 or |y2−x3|>c(ε)x1/2−ε.
* Lehmer's totient problem: if ϕ(n) divides n−1, must n be prime?
* Magic square of squares: is there a 3x3 magic square composed of distinct perfect squares?
* Mahler's 3/2 problem that no real number x has the property that the fractional parts of x(3/2)n are less than 1/2 for all positive integers n.
* Newman's conjecture: the partition function satisfies any arbitrary congruence infinitely often.
* Scholz conjecture: the length of the shortest addition chain producing 2n−1 is at most n−1 plus the length of the shortest addition chain producing n.
* Singmaster's conjecture: is there a finite upper bound on the multiplicities of the entries greater than 1 in Pascal's triangle?[166]
* Are there infinitely many perfect numbers?
* Do any odd perfect numbers exist?
* Do quasiperfect numbers exist?
* Do any non-power of 2 almost perfect numbers exist?
* Are there 65, 66, or 67 idoneal numbers?
* Are there any pairs of amicable numbers which have opposite parity?
* Are there any pairs of betrothed numbers which have same parity?
* Are there any pairs of relatively prime amicable numbers?
* Are there infinitely many pairs of amicable numbers?
* Are there infinitely many betrothed numbers?
* Are there infinitely many Giuga numbers?
* Do any Lychrel numbers exist in base 10?
* Do any odd noncototients exist?
* Do any odd weird numbers exist?
* Do any (2, 5)-perfect numbers exist?
* Do any Taxicab(5, 2, n) exist for n > 1?
* Is there a covering system with odd distinct moduli?[167]
* Is π a normal number (i.e., is each digit 0–9 equally frequent)?[168]
* Are all irrational algebraic numbers normal?
* Is 10 a solitary number?

#### Additive number theory

Main article: Additive number theory

See also: Problems involving arithmetic progressions

* Erdős conjecture on arithmetic progressions that if the sum of the reciprocals of the members of a set of positive integers diverges, then the set contains arbitrarily long arithmetic progressions.
* Erdős–Turán conjecture on additive bases: if B is an additive basis of order 2, then the number of ways that positive integers n can be expressed as the sum of two numbers in B must tend to infinity as n tends to infinity.
* Gilbreath's conjecture on consecutive applications of the unsigned forward difference operator to the sequence of prime numbers.
* Goldbach's conjecture: every even natural number greater than 2 is the sum of two prime numbers.
* Lander, Parkin, and Selfridge conjecture: if the sum of m k-th powers of positive integers is equal to a different sum of n k-th powers of positive integers, then m+n≥k.
* Lemoine's conjecture: all odd integers greater than 5 can be represented as the sum of an odd prime number and an even semiprime.
* Minimum overlap problem of estimating the minimum possible maximum number of times a number appears in the termwise difference of two equally large sets partitioning the set {1,…,2n}
* Pollock's conjectures
* Does every nonnegative integer appear in Recamán's sequence?
* Skolem problem: can an algorithm determine if a constant-recursive sequence contains a zero?
* The values of g(k) and G(k) in Waring's problem
* Do the Ulam numbers have a positive density?
* Determine growth rate of rk(N) (see Szemerédi's theorem)

#### Algebraic number theory

Main article: Algebraic number theory

* Class number problem: are there infinitely many real quadratic number fields with unique factorization?
* Fontaine–Mazur conjecture: actually numerous conjectures, all proposed by Jean-Marc Fontaine and Barry Mazur.
* Gan–Gross–Prasad conjecture: a restriction problem in representation theory of real or p-adic Lie groups.
* Greenberg's conjectures
* Hermite's problem: is it possible, for any natural number n, to assign a sequence of natural numbers to each real number such that the sequence for x is eventually periodic if and only if x is algebraic of degree n?
* Hilbert's 9th problem: find the most general reciprocity law for the norm residues of k-th order in a general algebraic number field, where k is a power of a prime.
* Hilbert's 11th problem: classify quadratic forms over algebraic number fields.
* Hilbert's 12th problem: extend the Kronecker–Weber theorem on Abelian extensions of ℚ to any base number field.
* Kummer–Vandiver conjecture: primes p do not divide the class number of the maximal real subfield of the p-th cyclotomic field.
* Lang and Trotter's conjecture on supersingular primes that the number of supersingular primes less than a constant X is within a constant multiple of X/ln⁡X
* Leopoldt's conjecture: a p-adic analogue of the regulator of an algebraic number field does not vanish.
* Stark conjectures (including Brumer–Stark conjecture)
* Characterize all algebraic number fields that have some power basis.

#### Analytic number theory

Main article: Analytic number theory

* Beilinson's conjectures about special values of L-functions.
* Do Siegel zeros exist?
* Find the value of the De Bruijn–Newman constant.
* Is Selberg class of Dirichlet series equal to class of automorphic L-functions?
* Hardy–Littlewood zeta function conjectures
* Keating–Snaith conjecture concerning the asymptotics of an integral involving the Riemann zeta function[169]
* Hilbert–Pólya conjecture: the nontrivial zeros of the Riemann zeta function correspond to eigenvalues of a self-adjoint operator.
* Lindelöf hypothesis that for all ε>0, ζ(1/2+it)=o(tε)
* The density hypothesis for zeroes of the Riemann zeta function.
* Location of nontrivial zeros of L-functions, especially conjectures concerning their critical lines:
* Grand Riemann hypothesis: do the nontrivial zeros of all automorphic L-functions lie on the critical line 1/2+it with real t?
* Generalized Riemann hypothesis for Selberg class: do the nontrivial zeros of all functions in Selberg class lie on the critical line 1/2+it with real t?
* Extended Riemann Hypothesis: do the nontrivial zeros of all Dedekind zeta functions lie on the critical line 1/2+it with real t?
* Generalized Riemann hypothesis: do the nontrivial zeros of all Dirichlet L-functions lie on the critical line 1/2+it with real t?
* Riemann hypothesis: do the nontrivial zeros of the Riemann zeta function lie on the critical line 1/2+it with real t?
* Montgomery's pair correlation conjecture: the normalized pair correlation function between pairs of zeros of the Riemann zeta function is the same as the pair correlation function of random Hermitian matrices.
* Piltz divisor problem on bounding Δk(x)=Dk(x)−xPk(log⁡(x))
* Dirichlet's divisor problem: the specific case of the Piltz divisor problem for: k=1
* Ramanujan–Petersson conjecture: a number of generalizations of the original conjecture, concerning growth rate of coefficients of automorphic forms.
* Selberg's 1/4 conjecture: the eigenvalues of the Laplace operator on Maass wave forms of congruence subgroups are at least 1/4.
* Selberg's orthogonality conjecture: generalization of Mertens' theorem for functions in Selberg class.

#### Arithmetic geometry

Main article: Arithmetic geometry

* Bombieri–Lang conjecture: K-rational points on a variety of general type over a number field K are not a dense set in Zariski topology.
* Erdős–Ulam problem: Is there a dense set of points in the plane all at rational distances from one another?
* Manin conjecture: if K-rational points on Fano variety are Zariski-dense subset, then the distribution of points of height: H(x)≤B in any Zariski-open subset U is proportional to Blog⁡(B)r−1, where r is rank of Picard group of that variety.
* Sato–Tate conjecture: also a number of related conjectures that are generalizations of the original conjecture.
* In Unit square:
* Rational dense problem: Is there a point in the plane at a rational distance from all four corners of a unit square?[170]
* Vojta's conjecture: points on non-singular algebraic variety over algebraic number field that not satisfy certain height inequality are contained in some Zariski-closed set.
* n conjecture: a generalization of the abc conjecture to more than three integers.
* abc conjecture: for any ε>0, rad⁡(abc)1+ε<c is true for only finitely many positive a,b,c such that a+b=c.
* Szpiro's conjecture: for any ε>0, there is some constant C(ε) such that, for any elliptic curve E defined over ℚ with minimal discriminant Δ and conductor f, we have |Δ|≤C(ε)⋅f6+ε.
* Zilber–Pink conjecture that if X is a mixed Shimura variety or semiabelian variety defined over ℂ, and V⊆X is a subvariety, then V contains only finitely many maximal atypical subvarieties.

#### Computational number theory

Main article: Computational number theory

* Can integer factorization be done in polynomial time?
* Can a discrete logarithm be computed in polynomial time?
* Can a discrete logarithm on a elliptic curve be computed in sub-exponential time?
* Does every rational number with an odd denominator have an odd greedy expansion?

#### Diophantine approximation and transcendental number theory

The area of the blue region converges to the Euler–Mascheroni constant, which may or may not be a rational number.

* Littlewood conjecture: for any two real numbers α,β, lim infn->∞n‖nα‖‖nβ‖=0, where ‖x‖ is the distance from x to the nearest integer.
* Schanuel's conjecture on the transcendence degree of certain field extensions of the rational numbers.[171] In particular: Are π and e algebraically independent? Which nontrivial combinations of transcendental numbers (such as e+π,eπ,πe,ππ,ee) are themselves transcendental?[172][173]
* The four exponentials conjecture: the transcendence of at least one of four exponentials of combinations of irrationals[171]
* Are Euler's constant γ and Catalan's constant G irrational? Are they transcendental? Is Apéry's constant ζ(3) transcendental?[174][175]
* Which transcendental numbers are (exponential) periods?[176]
* How well can non-quadratic irrational numbers be approximated? What is the irrationality measure of specific (suspected) transcendental numbers such as π and γ?[175]
* Which irrational numbers have simple continued fraction terms whose geometric mean converges to Khinchin's constant?[177]
* Hartmanis–Stearns conjecture

#### Diophantine equations

* Beal's conjecture: for all integral solutions to Ax+By=Cz where x,y,z>2, all three numbers A,B,C must share some prime factor.
* Brocard's problem: are there any integer solutions to n!+1=m2 other than n=4,5,7?
* Congruent number problem (a corollary to Birch and Swinnerton-Dyer conjecture, per Tunnell's theorem): determine precisely what rational numbers are congruent numbers.
* Erdős–Moser problem: is 11+21=31 the only solution to the Erdős–Moser equation?
* Erdős–Straus conjecture: for every n≥2, there are positive integers x,y,z such that 4/n=1/x+1/y+1/z.
* Fermat–Catalan conjecture: there are finitely many distinct solutions (am,bn,ck) to the equation am+bn=ck with a,b,c being positive coprime integers and m,n,k being positive integers satisfying 1/m+1/n+1/k<1.
* Goormaghtigh conjecture on solutions to (xm−1)/(x−1)=(yn−1)/(y−1) where x>y>1 and m,n>2.
* The uniqueness conjecture for Markov numbers[178] that every Markov number is the largest number in exactly one normalized solution to the Markov Diophantine equation.
* Pillai's conjecture: for any A,B,C, the equation Axm−Byn=C has finitely many solutions when m,n are not both 2.
* Which integers can be written as the sum of three perfect cubes?[179]
* Can every integer be written as a sum of four perfect cubes?

#### Prime numbers

* v
* t
* e

Prime number conjectures

* Hardy–Littlewood
* 1st
* 2nd
* Agoh–Giuga
* Andrica's
* Artin's
* Bateman–Horn
* Brocard's
* Bunyakovsky
* Chinese hypothesis
* Cramér's
* Dickson's
* Dubner's
* Elliott–Halberstam
* Firoozbakht's
* Gilbreath's
* Grimm's
* Landau's problems
* Goldbach's
* weak
* Legendre's
* Twin prime
* Legendre's constant
* Lemoine's
* Mersenne
* Oppermann's
* Polignac's
* Pólya
* Redmond–Sun
* Schinzel's hypothesis H
* Waring's prime 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.

* Agoh–Giuga conjecture on the Bernoulli numbers that p is prime if and only if pBp−1≡−1(modp)
* Agrawal's conjecture that given coprime positive integers n and r, if (X−1)n≡Xn−1(modn,Xr−1), then either n is prime or n2≡1(modr)
* Artin's conjecture on primitive roots that if an integer is neither a perfect square nor −1, then it is a primitive root modulo infinitely many prime numbers p
* Brocard's conjecture: there are always at least 4 prime numbers between consecutive squares of prime numbers, aside from 22 and 32.
* Bunyakovsky conjecture: if an integer-coefficient polynomial f has a positive leading coefficient, is irreducible over the integers, and has no common factors over all f(x) where x is a positive integer, then f(x) is prime infinitely often.
* Catalan's Mersenne conjecture: some Catalan–Mersenne number is composite and thus all Catalan–Mersenne numbers are composite after some point.
* Dickson's conjecture: for a finite set of linear forms a1+b1n,…,ak+bkn with each bi≥1, there are infinitely many n for which all forms are prime, unless there is some congruence condition preventing it.
* Dubner's conjecture: every even number greater than 4208 is the sum of two primes which both have a twin.
* Elliott–Halberstam conjecture on the distribution of prime numbers in arithmetic progressions.
* Erdős–Mollin–Walsh conjecture: no three consecutive numbers are all powerful.
* Feit–Thompson conjecture: for all distinct prime numbers p and q, (pq−1)/(p−1) does not divide (qp−1)/(q−1)
* Fortune's conjecture that no Fortunate number is composite.
* The Gaussian moat problem: is it possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded?
* Gillies' conjecture on the distribution of prime divisors of Mersenne numbers.
* Landau's problems
* Goldbach conjecture: all even natural numbers greater than 2 are the sum of two prime numbers.
* Legendre's conjecture: for every positive integer n, there is a prime between n2 and (n+1)2.
* Twin prime conjecture: there are infinitely many twin primes.
* Are there infinitely many primes of the form n2+1?
* Problems associated to Linnik's theorem
* New Mersenne conjecture: for any odd natural number p, if any two of the three conditions p=2k±1 or p=4k±3, 2p−1 is prime, and (2p+1)/3 is prime are true, then the third condition is also true.
* Polignac's conjecture: for all positive even numbers n, there are infinitely many prime gaps of size n.
* Schinzel's hypothesis H that for every finite collection {f1,…,fk} of nonconstant irreducible polynomials over the integers with positive leading coefficients, either there are infinitely many positive integers n for which f1(n),…,fk(n) are all primes, or there is some fixed divisor m>1 which, for all n, divides some fi(n).
* Selfridge's conjecture: is 78,557 the lowest Sierpiński number?
* Does the converse of Wolstenholme's theorem hold for all natural numbers?
* Are all Euclid numbers square-free?
* Are all Fermat numbers square-free?
* Are all Mersenne numbers of prime index square-free?
* Are there any composite c satisfying 2c − 1 ≡ 1 (mod c2)?
* Are there any Wall–Sun–Sun primes?
* Are there any Wieferich primes in base 47?
* Are there infinitely many balanced primes?
* Are there infinitely many cluster primes?
* Are there infinitely many cousin primes?
* Are there infinitely many Cullen primes?
* Are there infinitely many Euclid primes?
* Are there infinitely many Fibonacci primes?
* Are there infinitely many Kummer primes?
* Are there infinitely many Kynea primes?
* Are there infinitely many Lucas primes?
* Are there infinitely many Mersenne primes (Lenstra–Pomerance–Wagstaff conjecture); equivalently, infinitely many even perfect numbers?
* Are there infinitely many Newman–Shanks–Williams primes?
* Are there infinitely many palindromic primes to every base?
* Are there infinitely many Pell primes?
* Are there infinitely many Pierpont primes?
* Are there infinitely many prime quadruplets?
* Are there infinitely many prime triplets?
* Siegel's conjecture: are there infinitely many regular primes, and if so is their natural density as a subset of all primes e−1/2?
* Are there infinitely many sexy primes?
* Are there infinitely many safe and Sophie Germain primes?
* Are there infinitely many Wagstaff primes?
* Are there infinitely many Wieferich primes?
* Are there infinitely many Wilson primes?
* Are there infinitely many Wolstenholme primes?
* Are there infinitely many Woodall primes?
* Can a prime p satisfy 2p−1≡1(modp2) and 3p−1≡1(modp2) simultaneously?[180]
* Does every prime number appear in the Euclid–Mullin sequence?
* What is the smallest Skewes's number?
* For any given integer a > 0, are there infinitely many Lucas–Wieferich primes associated with the pair (a, −1)? (Specially, when a = 1, this is the Fibonacci-Wieferich primes, and when a = 2, this is the Pell-Wieferich primes)
* For any given integer a > 0, are there infinitely many primes p such that ap − 1 ≡ 1 (mod p2)?[181]
* For any given integer b which is not a perfect power and not of the form −4k4 for integer k, are there infinitely many repunit primes to base b?
* For any given integers k≥1,b≥2,c≠0, with gcd(k, c) = 1 and gcd(b, c) = 1, are there infinitely many primes of the form (k×bn+c)/gcd⁡(k+c,b−1) with integer n ≥ 1?
* Is every Fermat number 22n+1 composite for n>4?
* Is 509,203 the lowest Riesel number?

### Set theory

Main article: Set theory

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.

* Does the partition principle (PP) imply the axiom of choice (AC)?
* (Woodin) Does the generalized continuum hypothesis below a strongly compact cardinal imply the generalized continuum hypothesis everywhere?
* Does the generalized continuum hypothesis entail ♢(Eλ+cf⁡(λ)) for every singular cardinal λ?
* Does the generalized continuum hypothesis imply the existence of an ℵ2-Suslin tree?
* If ℵω is a strong limit cardinal, is 2ℵω<ℵω1 (see Singular cardinals hypothesis)? The best bound, ℵω4, was obtained by Shelah using his PCF theory.
* The problem of finding the ultimate core model, one that contains all large cardinals.
* Woodin's Ω-conjecture: if there is a proper class of Woodin cardinals, then Ω-logic satisfies an analogue of Gödel's completeness theorem.
* Does the consistency of the existence of a strongly compact cardinal imply the consistent existence of a supercompact cardinal?
* Does there exist a Jónsson algebra on ℵω?
* Is OCA (the open coloring axiom) consistent with 2ℵ0>ℵ2?
* Reinhardt cardinals: Without assuming the axiom of choice, can a nontrivial elementary embedding V→V exist?

### Topology

Main article: Topology

The unknotting problem asks whether there is an efficient algorithm to identify when the shape presented in a knot diagram is actually the unknot.

* Baum–Connes conjecture: the assembly map is an isomorphism.
* Berge conjecture that the only knots in the 3-sphere which admit lens space surgeries are Berge knots.
* Bing–Borsuk conjecture: every n-dimensional homogeneous absolute neighborhood retract is a topological manifold.
* Borel conjecture: aspherical and closed manifolds are determined up to homeomorphism by their fundamental groups.
* Halperin conjecture on rational Serre spectral sequences of certain fibrations.
* Hilbert–Smith conjecture: if a locally compact topological group has a continuous, faithful group action on a topological manifold, then the group must be a Lie group.
* Mazur's conjectures[182]
* Novikov conjecture on the homotopy invariance of certain polynomials in the Pontryagin classes of a manifold, arising from the fundamental group.
* Quadrisecants of wild knots: it has been conjectured that wild knots always have infinitely many quadrisecants.[183]
* Telescope conjecture: the last of Ravenel's conjectures in stable homotopy theory to be resolved.[lower-alpha 2]
* Unknotting problem: can unknots be recognized in polynomial time?
* Volume conjecture relating quantum invariants of knots to the hyperbolic geometry of their knot complements.
* Whitehead conjecture: every connected subcomplex of a two-dimensional aspherical CW complex is aspherical.
* Zeeman conjecture: given a finite contractible two-dimensional CW complex K, is the space K×[0,1] collapsible?
* Nearby Lagrangian conjecture: prove or find a counter-example to the statement: Any closed exact Lagrangian submanifold of the cotangent bundle of a closed manifold is Hamiltonian isotopic to the zero section.[185]

## Problems solved since 1995

Ricci flow, here illustrated with a 2D manifold, was the key tool in Grigori Perelman's solution of the Poincaré conjecture.

### Algebra

* Existence of a non-sofic, discrete, countable group (OpenAI, 2026)[186]
* Jacobian conjecture for more than 2 dimensions (Levent Alpöge, 2026 using Claude Fable 5)[187][188][189]
* Dixmier conjecture for n≥3, stably equivalent to the Jacobian conjecture.
* Mazur's conjecture B (Vessilin Dimitrov, Ziyang Gao, and Philipp Habegger, 2020)[190]
* Suita conjecture (Qi'an Guan and Xiangyu Zhou, 2015)[191]
* Torsion conjecture (Loïc Merel, 1996)[192]
* Carlitz–Wan conjecture (Hendrik Lenstra, 1995)[193]
* Serre's nonnegativity conjecture (Ofer Gabber, 1995)

### Analysis

* Mizohata–Takeuchi conjecture (Hannah Cairo, 2025).[194][195]
* Kadison–Singer problem (Adam Marcus, Daniel Spielman and Nikhil Srivastava, 2013)[196][197] (and the Feichtinger's conjecture, Anderson's paving conjectures, Weaver's discrepancy theoretic KSr and KS'r conjectures, Bourgain-Tzafriri conjecture and Rε-conjecture)
* Ahlfors measure conjecture (Ian Agol, 2004)[198]
* Gradient conjecture (Krzysztof Kurdyka, Tadeusz Mostowski, Adam Parusinski, 1999)[199]

### Combinatorics

* Erdős unit distance conjecture (unspecified OpenAI LLM, 2026)[200]
* Erdős sumset conjecture (Joel Moreira, Florian Richter, Donald Robertson, 2018)[201]
* McMullen's g-conjecture on the possible numbers of faces of different dimensions in a simplicial sphere (also Grünbaum conjecture, several conjectures of Kühnel) (Karim Adiprasito, 2018)[202][203]
* Hirsch conjecture (Francisco Santos Leal, 2010)[204][205]
* Gessel's lattice path conjecture (Manuel Kauers, Christoph Koutschan, and Doron Zeilberger, 2009)[206]
* Stanley–Wilf conjecture (Gábor Tardos and Adam Marcus, 2004)[207] (and also the Alon–Friedgut conjecture)
* Kemnitz's conjecture (Christian Reiher, 2003, Carlos di Fiore, 2003)[208]
* Cameron–Erdős conjecture (Ben J. Green, 2003, Alexander Sapozhenko, 2003)[209][210]

### Dynamical systems

* Eremenko's conjecture: every component of the escaping set of an entire transcendental function is unbounded. (David Martí-Pete, Lasse Rempe, and James Waterman, 2025)[211]
* Zimmer's conjecture (Aaron Brown, David Fisher, and Sebastián Hurtado-Salazar, 2017)[212]
* Painlevé conjecture (Jinxin Xue, 2014)[213][214]

### Game theory

* Existence of a non-terminating game of beggar-my-neighbour (Brayden Casella, 2024)[215]
* The angel problem (Various independent proofs, 2006)[216][217][218][219]

### Geometry

#### 21st century

* Talagrand's convexity conjecture (Dongming Hua, Antoine Song, Stefan Tudose, GPT-5.5 Pro, 2026)[220][221]
* Carathéodory conjecture for surfaces of smoothness C4 (Brendan Guilfoyle and Wilhelm Klingenberg, 2025)[222]
* Einstein problem (David Smith, Joseph Samuel Myers, Craig S. Kaplan, Chaim Goodman-Strauss, 2024)[223]
* Maximal rank conjecture (Eric Larson, 2018)[224]
* Weibel's conjecture (Moritz Kerz, Florian Strunk, and Georg Tamme, 2018)[225]
* Yau's conjecture (Antoine Song, 2018)[226][227]
* Pentagonal tiling (Michaël Rao, 2017)[228]
* Willmore conjecture (Fernando Codá Marques and André Neves, 2012)[229]
* Erdős distinct distances problem (Larry Guth, Nets Hawk Katz, 2011)[230]
* Heterogeneous tiling conjecture (squaring the plane) (Frederick V. Henle and James M. Henle, 2008)[231]
* Tameness conjecture (Ian Agol, 2004)[198]
* Ending lamination theorem (Jeffrey F. Brock, Richard D. Canary, Yair N. Minsky, 2004)[232]
* Carpenter's rule problem (Robert Connelly, Erik Demaine, Günter Rote, 2003)[233]
* Lambda g conjecture (Carel Faber and Rahul Pandharipande, 2003)[234]
* Nagata's conjecture (Ivan Shestakov, Ualbai Umirbaev, 2003)[235]
* Double bubble conjecture (Michael Hutchings, Frank Morgan, Manuel Ritoré, Antonio Ros, 2002)[236]

#### 20th century

* Honeycomb theorem (Thomas Callister Hales, 1999)[237]
* Lange's conjecture (Montserrat Teixidor i Bigas and Barbara Russo, 1999)[238]
* Bogomolov conjecture (Emmanuel Ullmo, 1998, Shou-Wu Zhang, 1998)[239][240]
* Kepler conjecture (Samuel Ferguson, Thomas Callister Hales, 1998)[241]
* Dodecahedral conjecture (Thomas Callister Hales, Sean McLaughlin, 1998)[242]

### Graph theory

* Dinitz–Garg–Goemans conjecture (Dmitry Rybin, GPT-5.6 Pro, 2026)[243]
* Kahn–Kalai conjecture (Jinyoung Park and Huy Tuan Pham, 2022)[244]
* Blankenship–Oporowski conjecture on the book thickness of subdivisions (Vida Dujmović, David Eppstein, Robert Hickingbotham, Pat Morin, and David Wood, 2021)[245]
* Ringel's conjecture that the complete graph K2n+1 can be decomposed into 2n+1 copies of any tree with n edges (Richard Montgomery, Benny Sudakov, Alexey Pokrovskiy, 2020)[246][247]
* Disproof of Hedetniemi's conjecture on the chromatic number of tensor products of graphs (Yaroslav Shitov, 2019)[248]
* Kelmans–Seymour conjecture (Dawei He, Yan Wang, and Xingxing Yu, 2020)[249][250][251][252]
* Goldberg–Seymour conjecture (Guantao Chen, Guangming Jing, and Wenan Zang, 2019)[253]
* Babai's problem (Alireza Abdollahi, Maysam Zallaghi, 2015)[254]
* Alspach's conjecture (Darryn Bryant, Daniel Horsley, William Pettersson, 2014)
* Alon–Saks–Seymour conjecture (Hao Huang, Benny Sudakov, 2012)
* Read–Hoggar conjecture (June Huh, 2009)[255]
* Scheinerman's conjecture (Jeremie Chalopin and Daniel Gonçalves, 2009)[256]
* Erdős–Menger conjecture (Ron Aharoni, Eli Berger 2007)[257]
* Road coloring conjecture (Avraham Trahtman, 2007)[258]
* Robertson–Seymour theorem (Neil Robertson, Paul Seymour, 2004)[259]
* Strong perfect graph conjecture (Maria Chudnovsky, Neil Robertson, Paul Seymour and Robin Thomas, 2002)[260]
* Toida's conjecture (Mikhail Muzychuk, Mikhail Klin, and Reinhard Pöschel, 2001)[261]
* Harary's conjecture on the integral sum number of complete graphs (Zhibo Chen, 1996)[262]

### Group theory

* Wall's conjecture (American Institute of Mathematics workshop, 2012)[263]
* Hanna Neumann conjecture (Joel Friedman, 2011, Igor Mineyev, 2011)[264][265]
* Density theorem (Hossein Namazi, Juan Souto, 2010)[266]
* Full classification of finite simple groups (Koichiro Harada, Ronald Solomon, 2008)

### Number theory

#### 21st century

* André–Oort conjecture (Jonathan Pila, Ananth Shankar, Jacob Tsimerman, 2021)[267]
* Duffin–Schaeffer theorem (Dimitris Koukoulopoulos, James Maynard, 2019)
* Main conjecture in Vinogradov's mean-value theorem (Jean Bourgain, Ciprian Demeter, Larry Guth, 2015)[268]
* Goldbach's weak conjecture (Harald Helfgott, 2013)[269][270][271]
* Existence of bounded gaps between arbitrarily large primes (Yitang Zhang, Polymath8, James Maynard, 2013)[272][273][274]
* Sidon set problem (Javier Cilleruelo, Imre Z. Ruzsa, and Carlos Vinuesa, 2010)[275]
* Serre's modularity conjecture (Chandrashekhar Khare and Jean-Pierre Wintenberger, 2008)[276][277][278]
* Green–Tao theorem (Ben J. Green and Terence Tao, 2004)[279]
* Catalan's conjecture (Preda Mihăilescu, 2002)[280]
* Erdős–Graham problem (Ernest S. Croot III, 2000)[281]

#### 20th century

* Lafforgue's theorem (Laurent Lafforgue, 1998)[282]
* Fermat's Last Theorem (Andrew Wiles and Richard Taylor, 1995)[283][284]

### Ramsey theory

* Burr–Erdős conjecture (Choongbum Lee, 2017)[285]
* Boolean Pythagorean triples problem (Marijn Heule, Oliver Kullmann, Victor W. Marek, 2016)[286][287]

### Theoretical computer science

* Sensitivity conjecture for Boolean functions (Hao Huang, 2019)[288]

### Topology

* Deciding whether the Conway knot is a slice knot (Lisa Piccirillo, 2020)[289][290]
* Virtual Haken conjecture (Ian Agol, Daniel Groves, Jason Manning, 2012)[291] (and by work of Daniel Wise also virtually fibered conjecture)
* Hsiang–Lawson's conjecture (Simon Brendle, 2012)[292]
* Ehrenpreis conjecture (Jeremy Kahn, Vladimir Markovic, 2011)[293]
* Atiyah conjecture for groups with finite subgroups of unbounded order (Austin, 2009)[294]
* Cobordism hypothesis (Jacob Lurie, 2008)[295]
* Spherical space form conjecture (Grigori Perelman, 2006)
* Poincaré conjecture (Grigori Perelman, 2002)[296]
* Geometrization conjecture (Grigori Perelman,[296] series of preprints in 2002–2003)[297]
* Nikiel's conjecture (Mary Ellen Rudin, 1999)[298]
* Disproof of the Ganea conjecture (Iwase, 1997)[299]

### Uncategorised

#### 2010s

* Erdős discrepancy problem (Terence Tao, 2015)[300]
* Umbral moonshine conjecture (John F. R. Duncan, Michael J. Griffin, Ken Ono, 2015)[301]
* Anderson conjecture on the finite number of diffeomorphism classes of the collection of 4-manifolds satisfying certain properties (Jeff Cheeger, Aaron Naber, 2014)[302]
* Gaussian correlation inequality (Thomas Royen, 2014)[303]
* Beck's conjecture on discrepancies of set systems constructed from three permutations (Alantha Newman, Aleksandar Nikolov, 2011)[304]
* Bloch–Kato conjecture (Vladimir Voevodsky, 2011)[305] (and Quillen–Lichtenbaum conjecture and by work of Thomas Geisser and Marc Levine (2001) also Beilinson–Lichtenbaum conjecture[306][307]: 359 [308])

#### 2000s

* Kauffman–Harary conjecture (Thomas Mattman, Pablo Solis, 2009)[309]
* Surface subgroup conjecture (Jeremy Kahn, Vladimir Markovic, 2009)[310]
* Normal scalar curvature conjecture and the Böttcher–Wenzel conjecture (Zhiqin Lu, 2007)[311]
* Nirenberg–Treves conjecture (Nils Dencker, 2005)[312][313]
* Lax conjecture (Adrian Lewis, Pablo Parrilo, Motakuri Ramana, 2005)[314]
* The Langlands–Shelstad fundamental lemma (Ngô Bảo Châu and Gérard Laumon, 2004)[315]
* Milnor conjecture (Vladimir Voevodsky, 2003)[316]
* Kirillov's conjecture (Ehud Baruch, 2003)[317]
* Kouchnirenko's conjecture (Bertrand Haas, 2002)[318]
* n! conjecture (Mark Haiman, 2001)[319] (and also Macdonald positivity conjecture)
* Kato's conjecture (Pascal Auscher, Steve Hofmann, Michael Lacey, Alan McIntosh, and Philipp Tchamitchian, 2001)[320]
* Deligne's conjecture on 1-motives (Luca Barbieri-Viale, Andreas Rosenschon, Morihiko Saito, 2001)[321]
* Modularity theorem (Christophe Breuil, Brian Conrad, Fred Diamond, and Richard Taylor, 2001)[322]
* Erdős–Stewart conjecture (Florian Luca, 2001)[323]
* Berry–Robbins problem (Michael Atiyah, 2000)[324]

## See also

* AlphaEvolve — coding agent for designing advanced algorithms
* AlphaGeometry — AI application for geometry
* FunSearch — AI application for mathematical discovery
* List of conjectures
* List of unsolved problems in statistics
* List of unsolved problems in computer science
* List of unsolved problems in physics
* Lists of unsolved problems
* Open Problems in Mathematics
* The Great Mathematical Problems
* Scottish Book

## Notes

1. ↑ A counterexample has been announced, with a preprint made available on arXiv.[87]
2. ↑ A disproof has been announced, with a preprint made available on arXiv.[184]

## References

1. ↑ 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.
2. ↑ 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.
3. ↑ 3.0 3.1 "Millennium Problems". http://claymath.org/millennium-problems.
4. ↑ "Fields Medal awarded to Artur Avila". 2014-08-13. http://www2.cnrs.fr/en/2435.htm?debut=8&theme1=12.
5. ↑ Bellos, Alex (2014-08-13). "Fields Medals 2014: the maths of Avila, Bhargava, Hairer and Mirzakhani explained". https://www.theguardian.com/science/alexs-adventures-in-numberland/2014/aug/13/fields-medals-2014-maths-avila-bhargava-hairer-mirzakhani.
6. ↑ "DARPA invests in math". CNN. 2008-10-14. http://edition.cnn.com/2008/TECH/science/10/09/darpa.challenges/index.html.
7. ↑ "Broad Agency Announcement (BAA 07-68) for Defense Sciences Office (DSO)". DARPA. 2007-09-10. http://www.math.utk.edu/~vasili/refs/darpa07.MathChallenges.html.
8. ↑ "Math Problems Guide: From Simple to Hardest Math Problems Tips & Examples." (in en-US). https://blendedlearningmath.com/math-word-problems-to-challenge-university-students/.
9. ↑ "Poincaré Conjecture". http://www.claymath.org/millenium-problems/poincaré-conjecture.
10. ↑ rybu (November 7, 2009). "Smooth 4-dimensional Poincare conjecture". https://www.openproblemgarden.org/?q=op/smooth_4_dimensional_poincare_conjecture.
11. ↑ Khukhro, Evgeny I.; Mazurov, Victor D. (2019), Unsolved Problems in Group Theory. The Kourovka Notebook
12. ↑ RSFSR, MV i SSO; Russie), Uralʹskij gosudarstvennyj universitet im A. M. Gorʹkogo (Ekaterinbourg (1969) (in ru). Свердловская тетрадь: нерешенные задачи теории подгрупп. S. l.. https://books.google.com/books?id=nKwgzgEACAAJ.
13. ↑ Свердловская тетрадь: Сб. нерешённых задач по теории полугрупп. Свердловск: Уральский государственный университет. 1979.
14. ↑ Свердловская тетрадь: Сб. нерешённых задач по теории полугрупп. Свердловск: Уральский государственный университет. 1989.
15. ↑ (in ru) ДНЕСТРОВСКАЯ ТЕТРАДЬ, The Russian Academy of Sciences, 1993, http://math.nsc.ru/LBRT/a1/files/dnestr93.pdf
16. ↑ DNIESTER NOTEBOOK: Unsolved Problems in the Theory of Rings and Modules, https://math.usask.ca/~bremner/research/publications/dniester.pdf, retrieved 2019-08-15
17. ↑ (in ru) Эрлагольская тетрадь, The Novosibirsk State University, 2018, https://uamt.conf.nstu.ru/erl_note.pdf
18. ↑ 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.
19. ↑ Aschbacher, Michael (1990), "On Conjectures of Guralnick and Thompson", Journal of Algebra 135 (2): 277–343, doi:10.1016/0021-8693(90)90292-V
20. ↑ 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
21. ↑ Smyth, Chris (2008), "The Mahler measure of algebraic numbers: a survey", in McKee, James; Smyth, Chris, Number Theory and Polynomials, London Mathematical Society Lecture Note Series, 352, Cambridge University Press, pp. 322–349, ISBN 978-0-521-71467-9
22. ↑ Hazewinkel, Michiel, ed. (2001), "Pompeiu problem", Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4, https://www.encyclopediaofmath.org/index.php?title=Pompeiu_problem&oldid=14506
23. ↑ Csordas, George; Smith, Wayne (1994), "Lehmer pairs of zeros, the de Bruijn-Newman constant Λ, and the Riemann hypothesis", Constructive Approximation 10 (1): 107–129, doi:10.1007/BF01205170
24. ↑ 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 .
25. ↑ "Some remarks on the lonely runner conjecture". Contributions to Discrete Mathematics 13 (2): 1–31. 2018. doi:10.11575/cdm.v13i2.62728.
26. ↑ 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. doi:10.1112/S1461157013000259.
27. ↑ Bruhn, Henning; Schaudt, Oliver (2015), "The journey of the union-closed sets conjecture", Graphs and Combinatorics 31 (6): 2043–2074, doi:10.1007/s00373-014-1515-0, http://www.zaik.uni-koeln.de/~schaudt/UCSurvey.pdf, retrieved 2017-07-18
28. ↑ 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, PMID 16577800
29. ↑ "Dedekind Numbers and Related Sequences". http://www.sfu.ca/~tyusun/ThesisDedekind.pdf.
30. ↑ 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.
31. ↑ S. M. Ulam, Problems in Modern Mathematics. Science Editions John Wiley & Sons, Inc., New York, 1964, page 76.
32. ↑ Kaloshin, Vadim; Sorrentino, Alfonso (2018). "On the local Birkhoff conjecture for convex billiards". Annals of Mathematics 188 (1): 315–380. doi:10.4007/annals.2018.188.1.6.
33. ↑ 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
34. ↑ Paul Halmos, Ergodic theory. Chelsea, New York, 1956.
35. ↑ Bowman, Joshua (2015), "The way the billiard ball bounces", Math Horizons 22 (3): 18–22, doi:10.4169/mathhorizons.22.3.18
36. ↑ Kari, Jarkko (2009). "Structure of Reversible Cellular Automata". International Conference on Unconventional Computation. 5715. Springer. p. 6. doi:10.1007/978-3-642-03745-0_5. ISBN 978-3-642-03744-3. Bibcode: 2009LNCS.5715....6K.
37. ↑ 37.0 37.1 37.2 "Open Q – Solving and rating of hard Sudoku". http://english.log-it-ex.com/2.html.
38. ↑ "Higher-Dimensional Tic-Tac-Toe". YouTube. 2017-09-21. https://www.youtube.com/watch?v=FwJZa-helig.
39. ↑ Austin, David (August 2016), "Game. SET. Polynomial.", Feature column (American Mathematical Society), https://www.ams.org/samplings/feature-column/fc-2016-08 .
40. ↑ Barlet, Daniel; Peternell, Thomas; Schneider, Michael (1990). "On two conjectures of Hartshorne's". Mathematische Annalen 286 (1–3): 13–25. doi:10.1007/BF01453563.
41. ↑ Dupont, Johan L. (2001), Scissors congruences, group homology and characteristic classes, Nankai Tracts in Mathematics, 1, World Scientific Publishing Co., Inc., River Edge, NJ, p. 6, doi:10.1142/9789812810335, ISBN 978-981-02-4507-8, http://home.math.au.dk/dupont/scissors.ps .
42. ↑ Maulik, Davesh (2004-06-05), Gromov–Witten theory and Donaldson–Thomas theory, I, Bibcode: 2003math.....12059M
43. ↑ 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.
44. ↑ Bereg, Sergey; Dumitrescu, Adrian; Jiang, Minghui (2010), "On covering problems of Rado", Algorithmica 57 (3): 538–561, doi:10.1007/s00453-009-9298-z
45. ↑ Melissen, Hans (1993), "Densest packings of congruent circles in an equilateral triangle", American Mathematical Monthly 100 (10): 916–925, doi:10.2307/2324212
46. ↑ 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
47. ↑ The Reinhardt conjecture as an optimal control problem, 2017
48. ↑ Brass, Peter; Moser, William; Pach, János (2005), Research Problems in Discrete Geometry, New York: Springer, p. 45, ISBN 978-0387-23815-9, https://books.google.com/books?id=WehCspo0Qa0C&pg=PA45
49. ↑ Gardner, Martin (1995), New Mathematical Diversions (Revised Edition), Washington: Mathematical Association of America, p. 251
50. ↑ 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.
51. ↑ 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
52. ↑ Katz, Mikhail G. (2007), Systolic geometry and topology, Mathematical Surveys and Monographs, 137, American Mathematical Society, Providence, RI, p. 57, doi:10.1090/surv/137, ISBN 978-0-8218-4177-8, https://books.google.com/books?id=R5_zBwAAQBAJ&pg=PA57
53. ↑ Rosenberg, Steven (1997), The Laplacian on a Riemannian Manifold: An introduction to analysis on manifolds, London Mathematical Society Student Texts, 31, Cambridge: Cambridge University Press, pp. 62–63, doi:10.1017/CBO9780511623783, ISBN 978-0-521-46300-3, https://books.google.com/books?id=gzJ6Vn0y7XQC&pg=PA62
54. ↑ 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
55. ↑ 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, doi:10.1145/2543581.2543589
56. ↑ Brass, Peter; Moser, William; Pach, János (2005), Research problems in discrete geometry, Berlin: Springer, ISBN 0-387-23815-8
57. ↑ Boltjansky, V.; Gohberg, I. (1985), "11. Hadwiger's Conjecture", Results and Problems in Combinatorial Geometry, Cambridge University Press, pp. 44–46 .
58. ↑ 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 ; Suk, Andrew (2016), "On the Erdős–Szekeres convex polygon problem", J. Amer. Math. Soc. 30 (4): 1047–1053, doi:10.1090/jams/869
59. ↑ "The number of faces of centrally-symmetric polytopes", Graphs and Combinatorics 5 (1): 389–391, 1989, doi:10.1007/BF01788696 .
60. ↑ Moreno, José Pedro; Prieto-Martínez, Luis Felipe (2021). "El problema de los triángulos de Kobon" (in es). La Gaceta de la Real Sociedad Matemática Española 24 (1): 111–130.
61. ↑ "An olla-podrida of open problems, often oddly posed", American Mathematical Monthly 90 (3): 196–200, 1983, doi:10.2307/2975549
62. ↑ Lectures on discrete geometry, Graduate Texts in Mathematics, 212, Springer-Verlag, New York, 2002, p. 206, doi:10.1007/978-1-4613-0039-7, ISBN 978-0-387-95373-1
63. ↑ Burr, S. A.; Grünbaum, B.; Sloane, N. J. A. (1974), "The Orchard problem", Geometriae Dedicata 2 (4): 397–424, doi:10.1007/BF00147569
64. ↑ 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
65. ↑ "Improved bounds for planar k-sets and related problems", Discrete & Computational Geometry 19 (3): 373–382, 1998, doi:10.1007/PL00009354 ; Tóth, Gábor (2001), "Point sets with many k-sets", Discrete & Computational Geometry 26 (2): 187–194, doi:10.1007/s004540010022 .
66. ↑ 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". Discrete & Computational Geometry 38 (1): 1–14. doi:10.1007/s00454-007-1325-8. https://link.springer.com/content/pdf/10.1007/s00454-007-1325-8.pdf. Retrieved 22 July 2025.
67. ↑ 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, doi:10.37236/7224, Bibcode: 2017arXiv170610193A, https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p8, retrieved 2019-02-18
68. ↑ 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, doi:10.1098/rsta.2001.0840, ISSN 1364-503X, Bibcode: 2001RSPTA.359.1375A
69. ↑ Finch, S. R.; Wetzel, J. E. (2004), "Lost in a forest", American Mathematical Monthly 11 (8): 645–654, doi:10.2307/4145038
70. ↑ Howards, Hugh Nelson (2013), "Forming the Borromean rings out of arbitrary polygonal unknots", Journal of Knot Theory and Its Ramifications 22 (14): 1350083, 15, doi:10.1142/S0218216513500831
71. ↑ Miller, Ezra (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 . Announced in 2003.
72. ↑ Solomon, Yaar; Weiss, Barak (2016), "Dense forests and Danzer sets", Annales Scientifiques de l'École Normale Supérieure 49 (5): 1053–1074, doi:10.24033/asens.2303 ; Conway, John H., Five $1,000 Problems (Update 2017), On-Line Encyclopedia of Integer Sequences, https://oeis.org/A248380/a248380.pdf, retrieved 2019-02-12
73. ↑ Brandts, Jan; Korotov, Sergey; Křížek, Michal; Šolc, Jakub (2009), "On nonobtuse simplicial partitions", SIAM Review 51 (2): 317–335, doi:10.1137/060669073, Bibcode: 2009SIAMR..51..317B, https://pure.uva.nl/ws/files/836396/73198_315330.pdf, retrieved 2018-11-22 . See in particular Conjecture 23, p. 327.
74. ↑ Arutyunyants, G.; Iosevich, A. (2004), "Falconer conjecture, spherical averages and discrete analogs", in Pach, János, Towards a Theory of Geometric Graphs, Contemp. Math., 342, Amer. Math. Soc., Providence, RI, pp. 15–24, doi:10.1090/conm/342/06127, ISBN 978-0-8218-3484-8
75. ↑ Matschke, Benjamin (2014), "A survey on the square peg problem", Notices of the American Mathematical Society 61 (4): 346–352, doi:10.1090/noti1100
76. ↑ 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
77. ↑ Weaire, Denis, ed. (1997), The Kelvin Problem, CRC Press, p. 1, ISBN 978-0-7484-0632-6, https://books.google.com/books?id=otokU4KQnXIC&pg=PA1
78. ↑ Brass, Peter; Moser, William; Pach, János (2005), Research problems in discrete geometry, New York: Springer, p. 457, ISBN 978-0-387-29929-7, https://books.google.com/books?id=cT7TB20y3A8C&pg=PA457
79. ↑ Mahler, Kurt (1939). "Ein Minimalproblem für konvexe Polygone". Mathematica (Zutphen) B: 118–127.
80. ↑ Kawohl, Bernd; Weber, Christof (2011), "Meissner's Mysterious Bodies", Mathematical Intelligencer 33 (3): 94–101, doi:10.1007/s00283-011-9239-y, https://www.mi.uni-koeln.de/mi/Forschung/Kawohl/kawohl/pub100.pdf .
81. ↑ Norwood, Rick; Poole, George; Laidacker, Michael (1992), "The worm problem of Leo Moser", Discrete & Computational Geometry 7 (2): 153–162, doi:10.1007/BF02187832
82. ↑ Wagner, Neal R. (1976), "The Sofa Problem", The American Mathematical Monthly 83 (3): 188–189, doi:10.2307/2977022, http://www.cs.utsa.edu/~wagner/pubs/corner/corner_final.pdf, retrieved 2014-05-14
83. ↑ Senechal, Marjorie; Galiulin, R. V. (1984). "An introduction to the theory of figures: the geometry of E. S. Fedorov" (in en,fr). Structural Topology (10): 5–22.
84. ↑ 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.
85. ↑ 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
86. ↑ Steininger, Jakob; Yurkevich, Sergey (December 27, 2021), An algorithmic approach to Rupert's problem
87. ↑ Steininger, Jakob; Yurkevich, Sergey (2025), A convex polyhedron without Rupert's property
88. ↑ 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
89. ↑ 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.
90. ↑ Whyte, L. L. (1952), "Unique arrangements of points on a sphere", The American Mathematical Monthly 59 (9): 606–611, doi:10.2307/2306764
91. ↑ ACW (May 24, 2012), "Convex uniform 5-polytopes", Open Problem Garden, http://www.openproblemgarden.org/op/convex_uniform_5_polytopes, retrieved 2016-10-04 .
92. ↑ Klostermeyer, W.; Mynhardt, C. (2015). "Protecting a graph with mobile guards". Applicable Analysis and Discrete Mathematics 10: 21. doi:10.2298/aadm151109021k.
93. ↑ 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.
94. ↑ 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.
95. ↑ Baird, William; Bonato, Anthony (2012). "Meyniel's conjecture on the cop number: a survey". Journal of Combinatorics 3 (2): 225–238. doi:10.4310/JOC.2012.v3.n2.a6.
96. ↑ 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.
97. ↑ Bousquet, Nicolas; Bartier, Valentin (2019), "Linear Transformations Between Colorings in Chordal Graphs", in Bender, Michael A.; Svensson, Ola; Herman, Grzegorz, 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany, LIPIcs, 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
98. ↑ "To the Moon and beyond", Graph Theory: Favorite Conjectures and Open Problems, II, Problem Books in Mathematics, Springer International Publishing, 2018, pp. 115–133, doi:10.1007/978-3-319-97686-0_11, ISBN 978-3-319-97684-6
99. ↑ Erdős on Graphs: His Legacy of Unsolved Problems, A K Peters, 1998, pp. 97–99 .
100. ↑ "Extending the Gyárfás-Sumner conjecture", Journal of Combinatorial Theory, Series B 105: 11–16, 2014, doi:10.1016/j.jctb.2013.11.002
101. ↑ Toft, Bjarne (1996), "A survey of Hadwiger's conjecture", Congressus Numerantium 115: 249–283 .
102. ↑ Croft, Hallard T.; Falconer, Kenneth J. (1991), Unsolved Problems in Geometry, Springer-Verlag , Problem G10.
103. ↑ 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, http://amc-journal.eu/index.php/amc/article/viewFile/288/247, retrieved 2016-09-30 .
104. ↑ 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 .
105. ↑ Molloy, Michael (1998), "A bound on the total chromatic number", Combinatorica 18 (2): 241–280, doi:10.1007/PL00009820 .
106. ↑ Barát, János; Tóth, Géza (2010), "Towards the Albertson Conjecture", Electronic Journal of Combinatorics 17 (1): R73, doi:10.37236/345, Bibcode: 2009arXiv0909.0413B .
107. ↑ Fulek, Radoslav; Pach, János (2011), "A computational approach to Conway's thrackle conjecture", Computational Geometry 44 (6–7): 345–355, doi:10.1016/j.comgeo.2011.02.001 .
108. ↑ Gupta, Anupam; Newman, Ilan; Rabinovich, Yuri (2004), "Cuts, trees and ℓ1-embeddings of graphs", Combinatorica 24 (2): 233–269, doi:10.1007/s00493-004-0015-x
109. ↑ 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 .
110. ↑ Hliněný, Petr (2010), "20 years of Negami's planar cover conjecture", Graphs and Combinatorics 26 (4): 525–536, doi:10.1007/s00373-010-0934-9, http://www.fi.muni.cz/~hlineny/papers/plcover20-gc.pdf, retrieved 2016-10-04 .
111. ↑ 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
112. ↑ 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 .
113. ↑ Guy, R. K. (1960). "A combinatorial problem". Nabla (Bulletin of the Malayan Mathematical Society) 7: 68–72.
114. ↑ 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 .
115. ↑ Brouwer, Andries E.; Van Maldeghem, Hendrik (2022). "8.2 Conference matrices and conference graphs". Strongly regular graphs. New Mathematical Monographs. 41. American Mathematical Society. pp. 189–190. ISBN 978-1-316-51203-6. https://homepages.cwi.nl/~aeb/math/srg/rk3/srgw.pdf.
116. ↑ Conway, John H., Five $1,000 Problems (Update 2017), Online Encyclopedia of Integer Sequences, https://oeis.org/A248380/a248380.pdf, retrieved 2019-02-12
117. ↑ mdevos; Wood, David (December 7, 2019), "Jorgensen's Conjecture", Open Problem Garden, http://www.openproblemgarden.org/op/jorgensens_conjecture, retrieved 2016-11-13 .
118. ↑ Ducey, Joshua E. (2017), "On the critical group of the missing Moore graph", Discrete Mathematics 340 (5): 1104–1109, doi:10.1016/j.disc.2016.10.001
119. ↑ Blokhuis, A. (1988), "Geodetic graphs of diameter two", Geometriae Dedicata 25 (1–3): 527–533, doi:10.1007/BF00191941
120. ↑ Florek, Jan (2010), "On Barnette's conjecture", Discrete Mathematics 310 (10–11): 1531–1535, doi:10.1016/j.disc.2010.01.018 .
121. ↑ 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://ris.utwente.nl/ws/files/6416631/jgt21734.pdf
122. ↑ 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, ISBN 978-0-444-87803-8 .
123. ↑ 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 .
124. ↑ Chudnovsky, Maria (2014), "The Erdös–Hajnal conjecture—a survey", Journal of Graph Theory 75 (2): 178–190, doi:10.1002/jgt.21730, http://www.columbia.edu/~mc2775/EHsurvey.pdf, retrieved 2016-09-22 .
125. ↑ "Chords of longest circuits in locally planar graphs", European Journal of Combinatorics 28 (1): 315–321, 2007, doi:10.1016/j.ejc.2005.07.017
126. ↑ "Covering and packing in graphs. IV. Linear arboricity", Networks 11 (1): 69–72, 1981, doi:10.1002/net.3230110108 .
127. ↑ Babai, László (June 9, 1994). "Automorphism groups, isomorphism, reconstruction" (PostScript). Handbook of Combinatorics. https://newtraell.cs.uchicago.edu/files/tr_authentic/TR-94-10.ps.
128. ↑ 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
129. ↑ 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
130. ↑ Schwenk, Allen (2012). "Some History on the Reconstruction Conjecture". Joint Mathematics Meetings. https://faculty.nps.edu/rgera/conjectures/jmm2012/Schwenk, Some History on the RC.pdf. Retrieved 2018-11-26.
131. ↑ 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
132. ↑ "A proof of Sumner's universal tournament conjecture for large tournaments", Proceedings of the London Mathematical Society, Third Series 102 (4): 731–766, 2011, doi:10.1112/plms/pdq035 .
133. ↑ Tuza, Zsolt (1990). "A conjecture on triangles of graphs". Graphs and Combinatorics 6 (4): 373–380. doi:10.1007/BF01787705.
134. ↑ DeVos, Matthew (October 22, 2007), "Unfriendly partitions", Open problem garden, https://www.openproblemgarden.org/op/unfriendly_partitions
135. ↑ 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 .
136. ↑ 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, https://www.sciencedirect.com/science/article/pii/S0012365X09001769
137. ↑ 137.0 137.1 137.2 137.3 137.4 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. https://link.springer.com/book/10.1007/978-3-319-25859-1.
138. ↑ 138.0 138.1 138.2 138.3 138.4 Kitaev, Sergey (2017-05-16). "A Comprehensive Introduction to the Theory of Word-Representable Graphs" (in en). International Conference on Developments in Language Theory. doi:10.1007/978-3-319-62809-7_2.
139. ↑ 139.0 139.1 139.2 139.3 139.4 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.
140. ↑ 140.0 140.1 140.2 140.3 140.4 Kitaev, Sergey V.; Pyatkin, Artem V. (2018). "Графы, представимые в виде слов. Обзор результатов" (in ru). Дискретн. Анализ И Исслед. Опер. 25 (2): 19–53. doi:10.17377/daio.2018.25.588. http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=da&paperid=894&option_lang=rus.
141. ↑ Marc Elliot Glen (2016). "Colourability and word-representability of near-triangulations". arXiv:1605.01688 [math.CO].
142. ↑ Kitaev, Sergey (2014-03-06). "On graphs with representation number 3". arXiv:1403.1616v1 [math.CO].
143. ↑ Glen, Marc; Kitaev, Sergey; Pyatkin, Artem (2018). "On the representation number of a crown graph". Discrete Applied Mathematics 244: 89–93. doi:10.1016/j.dam.2018.03.013. https://www.sciencedirect.com/science/article/pii/S0166218X18301045.
144. ↑ Gurvich, V. (2011). "On exact blockers and anti-blockers, Δ-conjecture, and related problems". Discrete Applied Mathematics 159: 311–321. doi:10.1016/j.dam.2010.11.014.
145. ↑ 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.
146. ↑ Kozerenko, Sergiy; Skochko, Volodymyr (2014). "On graphs with graphic imbalance sequences". Algebra and Discrete Mathematics 18 (1): 97–108. https://www.researchgate.net/publication/289776294.
147. ↑ Spinrad, Jeremy P. (2003), "2. Implicit graph representation", Efficient Graph Representations, American Mathematical Soc., pp. 17–30, ISBN 978-0-8218-2815-1, https://books.google.com/books?id=RrtXSKMAmWgC&pg=PA17 .
148. ↑ "Seymour's 2nd Neighborhood Conjecture". https://faculty.math.illinois.edu/~west/openp/2ndnbhd.html.
149. ↑ 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.
150. ↑ mdevos (May 4, 2007). "5-flow conjecture". http://www.openproblemgarden.org/op/5_flow_conjecture.
151. ↑ mdevos (March 31, 2010). "4-flow conjecture". http://www.openproblemgarden.org/op/4_flow_conjecture.
152. ↑ Hrushovski, Ehud (1989). "Kueker's conjecture for stable theories". Journal of Symbolic Logic 54 (1): 207–220. doi:10.2307/2275025.
153. ↑ 153.0 153.1 153.2 Classification Theory. North-Holland. 1990.
154. ↑ Shelah, Saharon (2009). Classification theory for abstract elementary classes. College Publications. ISBN 978-1-904987-71-0.
155. ↑ Peretz, Assaf (2006). "Geometry of forking in simple theories". Journal of Symbolic Logic 71 (1): 347–359. doi:10.2178/jsl/1140641179.
156. ↑ Cherlin, Gregory; Shelah, Saharon (May 2007). "Universal graphs with a forbidden subtree". Journal of Combinatorial Theory. Series B 97 (3): 293–333. doi:10.1016/j.jctb.2006.05.008.
157. ↑ Džamonja, Mirna, "Club guessing and the universal models." On PCF, ed. M. Foreman, (Banff, Alberta, 2004).
158. ↑ Shelah, Saharon (1999). "Borel sets with large squares". Fundamenta Mathematicae 159 (1): 1–50. doi:10.4064/fm-159-1-1-50. Bibcode: 1998math......2134S.
159. ↑ Baldwin, John T. (July 24, 2009). Categoricity. American Mathematical Society. ISBN 978-0-8218-4893-7. https://www.math.uic.edu/~jbaldwin/pub/AEClec.pdf. Retrieved February 20, 2014.
160. ↑ Shelah, Saharon (2009). "Introduction to classification theory for abstract elementary classes". arXiv:0903.3428 [math.LO].
161. ↑ Gurevich, Yuri, "Monadic Second-Order Theories," in J. Barwise, S. Feferman, eds., Model-Theoretic Logics (New York: Springer-Verlag, 1985), 479–506.
162. ↑ Makowsky J, "Compactness, embeddings and definability," in Model-Theoretic Logics, eds Barwise and Feferman, Springer 1985 pps. 645–715.
163. ↑ Keisler, HJ (1967). "Ultraproducts which are not saturated". J. Symb. Log. 32 (1): 23–46. doi:10.2307/2271240.
164. ↑ Malliaris, Maryanthe; Shelah, Saharon (10 August 2012). "A Dividing Line Within Simple Unstable Theories". arXiv:1208.2140 [math.LO]. Malliaris, M.; Shelah, S. (2012). "A Dividing Line within Simple Unstable Theories". arXiv:1208.2140 [math.LO].
165. ↑ Rathjen, Michael (2023-08-01). "The Art of Measuring the Strength of Theories" (in en). Notices of the American Mathematical Society 70 (7): 1071–1079. doi:10.1090/noti2733. ISSN 0002-9920. https://www.ams.org/notices/202307/rnoti-p1071.pdf.
166. ↑ 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 .
167. ↑ 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
168. ↑ "Are the Digits of Pi Random? Berkeley Lab Researcher May Hold Key". http://www2.lbl.gov/Science-Articles/Archive/pi-random.html.
169. ↑ "Lectures on the Riemann zeta function (book review)", Bulletin of the American Mathematical Society 53 (3): 507–512, 2016, doi:10.1090/bull/1525
170. ↑ Unsolved Problems in Number Theory, Problem Books in Mathematics, 1 (2nd ed.), Springer-Verlag, 1991, pp. 181–185, doi:10.1007/978-1-4899-3585-4, ISBN 978-1-4899-3587-8
171. ↑ 171.0 171.1 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, https://books.google.com/books?id=Wrj0CAAAQBAJ&pg=PA14
172. ↑ Waldschmidt, Michel (2008). "An introduction to irrationality and transcendence methods.". 2008 Arizona Winter School. https://webusers.imj-prg.fr/~michel.waldschmidt/articles/pdf/AWSLecture5.pdf. Retrieved 15 December 2014.
173. ↑ Albert, John, Some unsolved problems in number theory, http://www2.math.ou.edu/~jalbert/courses/openprob2.pdf, retrieved 15 December 2014
174. ↑ For some background on the numbers in this problem, see articles by Eric W. Weisstein at Wolfram MathWorld (all articles accessed 22 August 2024):
* Euler's Constant
* Catalan's Constant
* Apéry's Constant
* irrational numbers ()
* transcendental numbers ()
* irrationality measures ()
175. ↑ 175.0 175.1 Waldschmidt, Michel (2003-12-24). "Open Diophantine Problems". arXiv:math/0312440.
176. ↑ Kontsevich, Maxim; Zagier, Don (2001), "Periods", in Engquist, Björn; Schmid, Wilfried (in en), 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, https://link.springer.com/chapter/10.1007/978-3-642-56478-9_39, retrieved 2024-08-22
177. ↑ Weisstein, Eric W.. "Khinchin's Constant" (in en). https://mathworld.wolfram.com/KhinchinsConstant.html.
178. ↑ 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
179. ↑ Huisman, Sander G. (2016). "Newer sums of three cubes". arXiv:1604.07746 [math.NT].
180. ↑ Dobson, J. B. (1 April 2017). "On Lerch's formula for the Fermat quotient". p. 23\. arXiv:1103.3907v6 [math.NT].`{{cite arXiv}}`: CS1 maint: overridden setting (link)
181. ↑ Ribenboim, P. (2006) (in de). Die Welt der Primzahlen. Springer-Lehrbuch (2nd ed.). Springer. pp. 242–243. doi:10.1007/978-3-642-18079-8. ISBN 978-3-642-18078-1. https://books.google.com/books?id=XMyzh-2SClUC&q=die+folgenden+probleme+sind+ungelöst&pg=PA242.
182. ↑ Mazur, Barry (1992), "The topology of rational points", Experimental Mathematics 1 (1): 35–45, doi:10.1080/10586458.1992.10504244, https://projecteuclid.org/euclid.em/1048709114, retrieved 2019-04-07
183. ↑ "Quadrisecants of knots and links", Journal of Knot Theory and Its Ramifications 3: 41–50, 1994, doi:10.1142/S021821659400006X
184. ↑ Burklund, Robert; Hahn, Jeremy; Levy, Ishan; Schlank, Tomer (2023). "K-theoretic counterexamples to Ravenel's telescope conjecture". arXiv:2310.17459 [math.AT].
185. ↑ "Celebratio Mathematica — Eliashberg — Generating functions". https://celebratio.org/Eliashberg_Y/article/1188/.
186. ↑ "Ten advances in mathematics and theoretical computer science" (in en-US). 2026-07-29. https://openai.com/index/ten-advances-in-mathematics/.
187. ↑ Matthew Sparkes (July 20, 2026). "AI's solution to 87-year-old riddle takes mathematicians by surprise". New Scientist. https://www.newscientist.com/article/2580374-ais-solution-to-87-year-old-riddle-takes-mathematicians-by-surprise/.
188. ↑ @__alpoge__. "hello there the jacobian conjecture is false". https://twitter.com/__alpoge__/status/2079028340955197566. Missing or empty `|date=` (help)
189. ↑ Weisstein, Eric W.. "Jacobian Conjecture". http://mathworld.wolfram.com/JacobianConjecture.html.
190. ↑ Dimitrov, Vessilin; Gao, Ziyang; Habegger, Philipp (2021). "Uniformity in Mordell–Lang for curves". Annals of Mathematics 194: 237–298. doi:10.4007/annals.2021.194.1.4. https://hal.sorbonne-universite.fr/hal-03374335/file/Dimitrov et al. - 2021 - Uniformity in Mordell–Lang for curves.pdf.
191. ↑ Guan, Qi'an; Zhou, Xiangyu (2015). "A solution of an L2 extension problem with optimal estimate and applications". Annals of Mathematics 181 (3): 1139–1208. doi:10.4007/annals.2015.181.3.6.
192. ↑ 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 124 (1): 437–449. doi:10.1007/s002220050059. Bibcode: 1996InMat.124..437M.
193. ↑ Cohen, Stephen D.; Fried, Michael D. (1995), "Lenstra's proof of the Carlitz–Wan conjecture on exceptional polynomials: an elementary version", Finite Fields and Their Applications 1 (3): 372–375, doi:10.1006/ffta.1995.1027
194. ↑ Hartnett, Kevin (2025-08-01). "At 17, Hannah Cairo Solved a Major Math Mystery" (in en). https://www.quantamagazine.org/at-17-hannah-cairo-solved-a-major-math-mystery-20250801/.
195. ↑ Cairo, Hannah (2025). "A Counterexample to the Mizohata-Takeuchi Conjecture". arXiv:2502.06137 [math.CA].
196. ↑ Casazza, Peter G.; Fickus, Matthew; Tremain, Janet C.; Weber, Eric (2006). "The Kadison-Singer problem in mathematics and engineering: A detailed account". in Han, Deguang; Jorgensen, Palle E. T.; Larson, David Royal. Large Deviations for Additive Functionals of Markov Chains: The 25th Great Plains Operator Theory Symposium, June 7–12, 2005, University of Central Florida, Florida. Contemporary Mathematics. 414. American Mathematical Society.. pp. 299–355. doi:10.1090/conm/414/07820. ISBN 978-0-8218-3923-2. https://books.google.com/books?id=9b-4uqEGJdoC&pg=PA299. Retrieved 24 April 2015.
197. ↑ Mackenzie, Dana. "Kadison–Singer Problem Solved". SIAM News (Society for Industrial and Applied Mathematics) (January/February 2014). https://www.siam.org/pdf/news/2123.pdf.
198. ↑ 198.0 198.1 Agol, Ian (2004). "Tameness of hyperbolic 3-manifolds". arXiv:math/0405568.
199. ↑ Kurdyka, Krzysztof; Mostowski, Tadeusz; Parusiński, Adam (2000). "Proof of the gradient conjecture of R. Thom". Annals of Mathematics 152 (3): 763–792. doi:10.2307/2661354.
200. ↑ "OpenAI disproves Erdős unit distance conjecture". https://community.wolfram.com/groups/-/m/t/3719376.
201. ↑ Moreira, Joel; Richter, Florian K.; Robertson, Donald (2019). "A proof of a sumset conjecture of Erdős" (in en-US). Annals of Mathematics 189 (2): 605–652. doi:10.4007/annals.2019.189.2.4.
202. ↑ Stanley, Richard P. (1994), "A survey of Eulerian posets", in Bisztriczky, T.; McMullen, P.; Schneider, R. et al., Polytopes: abstract, convex and computational (Scarborough, ON, 1993), NATO Advanced Science Institutes Series C: Mathematical and Physical Sciences, 440, Dordrecht: Kluwer Academic Publishers, pp. 301–333 . See in particular p. 316.
203. ↑ Kalai, Gil (2018-12-25). "Amazing: Karim Adiprasito proved the g-conjecture for spheres!". https://gilkalai.wordpress.com/2018/12/25/amazing-karim-adiprasito-proved-the-g-conjecture-for-spheres/.
204. ↑ Santos, Franciscos (2012). "A counterexample to the Hirsch conjecture". Annals of Mathematics 176 (1): 383–412. doi:10.4007/annals.2012.176.1.7.
205. ↑ Ziegler, Günter M. (2012). "Who solved the Hirsch conjecture?". Documenta Mathematica. Documenta Mathematica Series 6 (Extra Volume "Optimization Stories"): 75–85. doi:10.4171/dms/6/13. ISBN 978-3-936609-58-5. https://www.math.uni-bielefeld.de/documenta/vol-ismp/22_ziegler-guenter.html.
206. ↑ Kauers, Manuel; Koutschan, Christoph; Zeilberger, Doron (2009-07-14). "Proof of Ira Gessel's lattice path conjecture". Proceedings of the National Academy of Sciences 106 (28): 11502–11505. doi:10.1073/pnas.0901678106. ISSN 0027-8424. Bibcode: 2009PNAS..10611502K.
207. ↑ Chung, Fan; Greene, Curtis; Hutchinson, Joan (April 2015). "Herbert S. Wilf (1931–2012)". Notices of the AMS 62 (4): 358. doi:10.1090/noti1247. ISSN 1088-9477. OCLC 34550461. "The conjecture was finally given an exceptionally elegant proof by A. Marcus and G. Tardos in 2004.".
208. ↑ Savchev, Svetoslav (2005). "Kemnitz' conjecture revisited". Discrete Mathematics 297 (1–3): 196–201. doi:10.1016/j.disc.2005.02.018.
209. ↑ Green, Ben (2004). "The Cameron–Erdős conjecture". The Bulletin of the London Mathematical Society 36 (6): 769–778. doi:10.1112/S0024609304003650.
210. ↑ "News from 2007". AMS. 31 December 2007. https://www.ams.org/news?news_id=155. "The 2007 prize also recognizes Green for "his many outstanding results including his resolution of the Cameron-Erdős conjecture...""
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. doi:10.1090/jams/1049.
212. ↑ A bot will complete this citation soon. Click here to jump the queue arXiv:1710.02735.
213. ↑ Xue, Jinxin (2014). "Noncollision Singularities in a Planar Four-body Problem". arXiv:1409.0048 [math.DS].
214. ↑ Xue, Jinxin (2020). "Non-collision singularities in a planar 4-body problem". Acta Mathematica 224 (2): 253–388. doi:10.4310/ACTA.2020.v224.n2.a2.
215. ↑ Richard P Mann. "Known Historical Beggar-My-Neighbour Records". https://richardpmann.com/beggar-my-neighbour-records.html.
216. ↑ Bowditch, Brian H. (2006). "The angel game in the plane". School of Mathematics, University of Southampton: warwick.ac.uk Warwick University. http://homepages.warwick.ac.uk/~masgak/papers/bhb-angel.pdf.
217. ↑ Kloster, Oddvar. "A Solution to the Angel Problem". Oslo, Norway: SINTEF ICT. http://home.broadpark.no/~oddvark/angel/Angel.pdf.
218. ↑ Mathe, Andras (2007). "The Angel of power 2 wins". Combinatorics, Probability and Computing 16 (3): 363–374. doi:10.1017/S0963548306008303. http://homepages.warwick.ac.uk/~masibe/angel-mathe.pdf. Retrieved 2016-03-18.
219. ↑ Gacs, Peter (June 19, 2007). "THE ANGEL WINS". http://www.cs.bu.edu/~gacs/papers/angel.pdf.
220. ↑ Kasal, Krystal (24 May 2026). "Mathematicians solve decades-old mystery about the hidden order in high-dimensional randomness". in Clark, Gaby; Egan, Robert. https://phys.org/news/2026-05-mathematicians-decades-mystery-hidden-high.html.
221. ↑ Howlett, Joseph (19 May 2026). "'Sensational' proof topples decades-old geometry problem". in Billings, Lee. https://www.scientificamerican.com/article/sensational-proof-topples-decades-old-geometry-problem/.
222. ↑ Guilfoyle, B.; Klingenberg, W. (2025). "The three obdurate conjectures of differential geometry". Math. Proc. R. Ir. Acad. 125A: 9–17. doi:10.1353/mpr.2025.a968272.
223. ↑ Smith, David; Myers, Joseph Samuel; Kaplan, Craig S.; Goodman-Strauss, Chaim (2024). "An aperiodic monotile" (in en). Combinatorial Theory 4 (1). doi:10.5070/C64163843. ISSN 2766-1334. https://escholarship.org/uc/item/3317z9z9.
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, doi:10.1007/s00222-017-0752-2, Bibcode: 2018InMat.211..523K
226. ↑ Song, Antoine. "Existence of infinitely many minimal hypersurfaces in closed manifolds.". www.ams.org. https://www.ams.org/amsmtgs/2251_abstracts/1147-53-499.pdf. ""..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". https://www.claymath.org/people/antoine-song. ""...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, https://www.quantamagazine.org/pentagon-tiling-proof-solves-century-old-math-problem-20170711/, retrieved July 18, 2017
229. ↑ Marques, Fernando C.; Neves, André (2013). "Min-max theory and the Willmore conjecture". Annals of Mathematics 179 (2): 683–782. doi:10.4007/annals.2014.179.2.6.
230. ↑ Guth, Larry; Katz, Nets Hawk (2015). "On the Erdos distinct distance problem in the plane". Annals of Mathematics 181 (1): 155–190. doi:10.4007/annals.2015.181.1.2.
231. ↑ Henle, Frederick V.; Henle, James M.. "Squaring the Plane". maa.org Mathematics Association of America. http://www.ww.amc12.org/sites/default/files/pdf/pubs/SquaringThePlane.pdf.
232. ↑ Brock, Jeffrey F.; Canary, Richard D. (2012). "The classification of Kleinian surface groups, II: The Ending Lamination Conjecture". Annals of Mathematics 176 (1): 1–149. doi:10.4007/annals.2012.176.1.1.
233. ↑ "Straightening polygonal arcs and convexifying polygonal cycles", Discrete & Computational Geometry 30 (2): 205–239, 2003, doi:10.1007/s00454-003-0006-7, https://page.mi.fu-berlin.de/~rote/Papers/pdf/Straightening+polygonal+arcs+and+convexifying+polygonal+cycles-DCG.pdf
234. ↑ Faber, C.; Pandharipande, R. (2003), "Hodge integrals, partition matrices, and the λg conjecture", Ann. of Math., 2 157 (1): 97–124, doi:10.4007/annals.2003.157.97
235. ↑ Shestakov, Ivan P.; Umirbaev, Ualbai U. (2004). "The tame and the wild automorphisms of polynomial rings in three variables". Journal of the American Mathematical Society 17 (1): 197–227. doi:10.1090/S0894-0347-03-00440-5.
236. ↑ Hutchings, Michael; Morgan, Frank; Ritoré, Manuel; Ros, Antonio (2002). "Proof of the double bubble conjecture". Annals of Mathematics. Second Series 155 (2): 459–489. doi:10.2307/3062123.
237. ↑ "The Honeycomb Conjecture". Discrete & Computational Geometry 25: 1–22. 2001. doi:10.1007/s004540010071.
238. ↑ Teixidor i Bigas, Montserrat; Russo, Barbara (1999). "On a conjecture of Lange". Journal of Algebraic Geometry 8 (3): 483–496. ISSN 1056-3911. Bibcode: 1997alg.geom.10019R.
239. ↑ Ullmo, E (1998). "Positivité et Discrétion des Points Algébriques des Courbes". Annals of Mathematics 147 (1): 167–179. doi:10.2307/120987.
240. ↑ Zhang, S.-W. (1998). "Equidistribution of small points on abelian varieties". Annals of Mathematics 147 (1): 159–165. doi:10.2307/120986.
241. ↑ Hales, Thomas; Adams, Mark; Bauer, Gertrud; Dang, Dat Tat; Harrison, John; Hoang, Le Truong; Kaliszyk, Cezary; Magron, Victor et al. (2017). "A formal proof of the Kepler conjecture". Forum of Mathematics, Pi 5. doi:10.1017/fmp.2017.1.
242. ↑ Hales, Thomas C.; McLaughlin, Sean (2010). "The dodecahedral conjecture". Journal of the American Mathematical Society 23 (2): 299–344. doi:10.1090/S0894-0347-09-00647-X. Bibcode: 2010JAMS...23..299H.
243. ↑ Sparkes, Matthew (23 July 2026). "Extremely basic AI prompt cracks decades-old maths problem". New Scientist. https://www.newscientist.com/article/2580932-extremely-basic-ai-prompt-cracks-decades-old-maths-problem/.
244. ↑ Park, Jinyoung; Pham, Huy Tuan (2022-03-31). "A Proof of the Kahn-Kalai Conjecture". arXiv:2203.17207 [math.CO].
245. ↑ "Stack-number is not bounded by queue-number". Combinatorica 42 (2): 151–164. August 2021. doi:10.1007/s00493-021-4585-7.
246. ↑ Huang, C.; Kotzig, A.; Rosa, A. (1982). "Further results on tree labellings". Utilitas Mathematica 21: 31–48. .
247. ↑ Hartnett, Kevin (19 February 2020). "Rainbow Proof Shows Graphs Have Uniform Parts" (in en). https://www.quantamagazine.org/mathematicians-prove-ringels-graph-theory-conjecture-20200219/.
248. ↑ Shitov, Yaroslav (2019-09-01). "Counterexamples to Hedetniemi's conjecture". Annals of Mathematics 190 (2): 663–667. doi:10.4007/annals.2019.190.2.6. https://annals.math.princeton.edu/2019/190-2/p06. Retrieved 2021-07-19.
249. ↑ 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. doi:10.1016/j.jctb.2019.11.008. ISSN 0095-8956. http://www.sciencedirect.com/science/article/pii/S0095895619301224.
250. ↑ 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. doi:10.1016/j.jctb.2019.11.007. ISSN 0095-8956. http://www.sciencedirect.com/science/article/pii/S0095895619301212.
251. ↑ 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. doi:10.1016/j.jctb.2019.11.006. ISSN 0095-8956. http://www.sciencedirect.com/science/article/pii/S0095895619301200.
252. ↑ 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. doi:10.1016/j.jctb.2019.12.002. ISSN 0095-8956. http://www.sciencedirect.com/science/article/pii/S0095895619301248.
253. ↑ 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].
254. ↑ Abdollahi A., Zallaghi M. (2015). "Character sums for Cayley graphs". Communications in Algebra 43 (12): 5159–5167. doi:10.1080/00927872.2014.967398.
255. ↑ Huh, June (2012). "Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs". Journal of the American Mathematical Society 25 (3): 907–927. doi:10.1090/S0894-0347-2012-00731-0.
256. ↑ Chalopin, Jérémie; Gonçalves, Daniel (2009). "Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 – June 2, 2009". in Mitzenmacher, Michael. ACM. pp. 631–638. doi:10.1145/1536414.1536500.
257. ↑ "Menger's theorem for infinite graphs". Inventiones Mathematicae 176 (1): 1–62. 2009. doi:10.1007/s00222-008-0157-3. Bibcode: 2009InMat.176....1A.
258. ↑ Seigel-Itzkovich, Judy (2008-02-08). "Russian immigrant solves math puzzle". The Jerusalem Post. https://www.jpost.com/Home/Article.aspx?id=91431.
259. ↑ Diestel, Reinhard (2005). "Minors, Trees, and WQO". Graph Theory (Electronic Edition 2005 ed.). Springer. pp. 326–367. https://www.math.uni-hamburg.de/home/diestel/books/graph.theory/preview/Ch12.pdf.
260. ↑ Chudnovsky, Maria; Robertson, Neil; Seymour, Paul; Thomas, Robin (2002). "The strong perfect graph theorem". Annals of Mathematics 164: 51–229. doi:10.4007/annals.2006.164.51. Bibcode: 2002math.....12070C. https://annals.math.princeton.edu/2006/164-1/p02.
261. ↑ Klin, M. H., M. Muzychuk and R. Poschel: The isomorphism problem for circulant graphs via Schur ring theory, Codes and Association Schemes, American Math. Society, 2001.
262. ↑ Chen, Zhibo (1996). "Harary's conjectures on integral sum graphs". Discrete Mathematics 160 (1–3): 241–244. doi:10.1016/0012-365X(95)00163-Q. https://www.researchgate.net/publication/220188021.
263. ↑ https://aimath.org/news/wallsconjecture/
264. ↑ Friedman, Joel (January 2015). "Sheaves on Graphs, Their Homological Invariants, and a Proof of the Hanna Neumann Conjecture: with an Appendix by Warren Dicks" (in en). Memoirs of the American Mathematical Society 233 (1100): 0. doi:10.1090/memo/1100. ISSN 0065-9266. https://www.cs.ubc.ca/~jf/pubs/web_stuff/shnc_memoirs.pdf.
265. ↑ Mineyev, Igor (2012). "Submultiplicativity and the Hanna Neumann conjecture". Annals of Mathematics. Second Series 175 (1): 393–414. doi:10.4007/annals.2012.175.1.11.
266. ↑ Namazi, Hossein; Souto, Juan (2012). "Non-realizability and ending laminations: Proof of the density conjecture". Acta Mathematica 209 (2): 323–395. doi:10.1007/s11511-012-0088-0. https://www.researchgate.net/publication/228365532.
267. ↑ 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].
268. ↑ 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. doi:10.4007/annals.2016.184.2.7. Bibcode: 2015arXiv151201565B.
269. ↑ Helfgott, Harald A. (2013). "Major arcs for Goldbach's theorem". arXiv:1305.2897 [math.NT].
270. ↑ Helfgott, Harald A. (2012). "Minor arcs for Goldbach's problem". arXiv:1205.5252 [math.NT].
271. ↑ Helfgott, Harald A. (2013). "The ternary Goldbach conjecture is true". arXiv:1312.7748 [math.NT].
272. ↑ Zhang, Yitang (2014-05-01). "Bounded gaps between primes". Annals of Mathematics 179 (3): 1121–1174. doi:10.4007/annals.2014.179.3.7. ISSN 0003-486X.
273. ↑ "Bounded gaps between primes – Polymath Wiki". https://asone.ai/polymath/index.php?title=Bounded_gaps_between_primes.
274. ↑ Maynard, James (2015-01-01). "Small gaps between primes". Annals of Mathematics: 383–413. doi:10.4007/annals.2015.181.1.7. ISSN 0003-486X.
275. ↑ Cilleruelo, Javier (2010). "Generalized Sidon sets". Advances in Mathematics 225 (5): 2786–2807. doi:10.1016/j.aim.2010.05.010.
276. ↑ Khare, Chandrashekhar; Wintenberger, Jean-Pierre (2009), "Serre's modularity conjecture (I)", Inventiones Mathematicae 178 (3): 485–504, doi:10.1007/s00222-009-0205-7, Bibcode: 2009InMat.178..485K
277. ↑ Khare, Chandrashekhar; Wintenberger, Jean-Pierre (2009), "Serre's modularity conjecture (II)", Inventiones Mathematicae 178 (3): 505–586, doi:10.1007/s00222-009-0206-6, Bibcode: 2009InMat.178..505K
278. ↑ "2011 Cole Prize in Number Theory". Notices of the AMS 58 (4): 610–611. ISSN 1088-9477. OCLC 34550461. https://www.ams.org/notices/201104/rtx110400610p.pdf. Retrieved 2015-11-12.
279. ↑ "Bombieri and Tao Receive King Faisal Prize". Notices of the AMS 57 (5): 642–643. May 2010. ISSN 1088-9477. OCLC 34550461. https://www.ams.org/notices/201005/rtx100500642p.pdf. Retrieved 2016-03-18. "Working with Ben Green, he proved there are arbitrarily long arithmetic progressions of prime numbers—a result now known as the Green–Tao theorem.".
280. ↑ Metsänkylä, Tauno (5 September 2003). "Catalan's conjecture: another old diophantine problem solved". Bulletin of the American Mathematical Society 41 (1): 43–57. doi:10.1090/s0273-0979-03-00993-5. ISSN 0273-0979. https://www.ams.org/journals/bull/2004-41-01/S0273-0979-03-00993-5/S0273-0979-03-00993-5.pdf. Retrieved 13 November 2015. "The conjecture, which dates back to 1844, was recently proven by the Swiss mathematician Preda Mihăilescu.".
281. ↑ 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. doi:10.4007/annals.2003.157.545. Bibcode: 2003math.....11421C.
282. ↑ Lafforgue, Laurent (1998), "Chtoucas de Drinfeld et applications" (in fr), Documenta Mathematica II: 563–570, ISSN 1431-0635, http://www.math.uni-bielefeld.de/documenta/xvol-icm/07/Lafforgue.MAN.html, retrieved 2016-03-18
283. ↑ Wiles, Andrew (1995). "Modular elliptic curves and Fermat's Last Theorem". Annals of Mathematics 141 (3): 443–551. doi:10.2307/2118559. OCLC 37032255. http://math.stanford.edu/~lekheng/flt/wiles.pdf. Retrieved 2016-03-06.
284. ↑ Taylor R, Wiles A (1995). "Ring theoretic properties of certain Hecke algebras". Annals of Mathematics 141 (3): 553–572. doi:10.2307/2118560. OCLC 37032255. http://www.math.harvard.edu/~rtaylor/hecke.ps.
285. ↑ Lee, Choongbum (2017). "Ramsey numbers of degenerate graphs". Annals of Mathematics 185 (3): 791–829. doi:10.4007/annals.2017.185.3.2.
286. ↑ Lamb, Evelyn (26 May 2016). "Two-hundred-terabyte maths proof is largest ever". Nature 534 (7605): 17–18. doi:10.1038/nature.2016.19990. PMID 27251254. Bibcode: 2016Natur.534...17L.
287. ↑ "Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer". Theory and Applications of Satisfiability Testing – SAT 2016. Lecture Notes in Computer Science. 9710. Springer, [Cham]. 2016. pp. 228–245. doi:10.1007/978-3-319-40970-2_15. ISBN 978-3-319-40969-6.
288. ↑ Linkletter, David (27 December 2019). "The 10 Biggest Math Breakthroughs of 2019". Popular Mechanics. https://www.popularmechanics.com/science/math/g30346822/biggest-math-breakthroughs-2019/.
289. ↑ Piccirillo, Lisa (2020). "The Conway knot is not slice". Annals of Mathematics 191 (2): 581–591. doi:10.4007/annals.2020.191.2.5. https://annals.math.princeton.edu/2020/191-2/p05.
290. ↑ Klarreich, Erica (2020-05-19). "Graduate Student Solves Decades-Old Conway Knot Problem" (in en). https://www.quantamagazine.org/graduate-student-solves-decades-old-conway-knot-problem-20200519/.
291. ↑ Agol, Ian (2013). "The virtual Haken conjecture (with an appendix by Ian Agol, Daniel Groves, and Jason Manning)". Documenta Mathematica 18: 1045–1087. doi:10.4171/dm/421. https://www.math.uni-bielefeld.de/documenta/vol-18/33.pdf.
292. ↑ "Embedded minimal tori in S3 and the Lawson conjecture". Acta Mathematica 211 (2): 177–190. 2013. doi:10.1007/s11511-013-0101-2.
293. ↑ "The good pants homology and the Ehrenpreis conjecture". Annals of Mathematics 182 (1): 1–72. 2015. doi:10.4007/annals.2015.182.1.1.
294. ↑ Austin, Tim (December 2013). "Rational group ring elements with kernels having irrational dimension". Proceedings of the London Mathematical Society 107 (6): 1424–1448. doi:10.1112/plms/pdt029. Bibcode: 2009arXiv0909.2360A.
295. ↑ Lurie, Jacob (2009). "On the classification of topological field theories". Current Developments in Mathematics 2008: 129–280. doi:10.4310/cdm.2008.v2008.n1.a3. Bibcode: 2009arXiv0905.0465L.
296. ↑ 296.0 296.1 "Prize for Resolution of the Poincaré Conjecture Awarded to Dr. Grigoriy Perelman" (PDF) (Press release). Clay Mathematics Institute. March 18, 2010. Archived from the original on March 22, 2010. Retrieved November 13, 2015. "The Clay Mathematics Institute hereby awards the Millennium Prize for resolution of the Poincaré conjecture to Grigoriy Perelman."
297. ↑ Morgan, John; Tian, Gang (2008). "Completion of the Proof of the Geometrization Conjecture". arXiv:0809.4040 [math.DG].
298. ↑ "Nikiel's Conjecture". Topology and Its Applications 116 (3): 305–331. 2001. doi:10.1016/S0166-8641(01)00218-8.
299. ↑ Iwase, Norio (November 1998). "Ganea's Conjecture on Lusternik-Schnirelmann Category". Bulletin of the London Mathematical Society 30 (6): 623–634. doi:10.1112/S0024609398004548.
300. ↑ Tao, Terence (2015). "The Erdős discrepancy problem". arXiv:1509.05363v5 [math.CO].
301. ↑ 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. doi:10.1186/s40687-015-0044-7. Bibcode: 2015arXiv150301472D.
302. ↑ Cheeger, Jeff; Naber, Aaron (2015). "Regularity of Einstein Manifolds and the Codimension 4 Conjecture". Annals of Mathematics 182 (3): 1093–1165. doi:10.4007/annals.2015.182.3.5.
303. ↑ Wolchover, Natalie (March 28, 2017). "A Long-Sought Proof, Found and Almost Lost". Quanta Magazine. https://www.quantamagazine.org/20170328-statistician-proves-gaussian-correlation-inequality/. Retrieved May 2, 2017.
304. ↑ Newman, Alantha; Nikolov, Aleksandar (2011). "A counterexample to Beck's conjecture on the discrepancy of three permutations". arXiv:1104.2922 [cs.DM].
305. ↑ Voevodsky, Vladimir (1 July 2011). "On motivic cohomology with Z/l-coefficients". Princeton, NJ: Princeton University. pp. 401–438. https://annals.math.princeton.edu/wp-content/uploads/annals-v174-n1-p11-p.pdf.
306. ↑ Geisser, Thomas; Levine, Marc (2001). "The Bloch-Kato conjecture and a theorem of Suslin-Voevodsky". Journal für die Reine und Angewandte Mathematik 2001 (530): 55–103. doi:10.1515/crll.2001.006.
307. ↑ Kahn, Bruno. "Algebraic K-Theory, Algebraic Cycles and Arithmetic Geometry". https://webusers.imj-prg.fr/~bruno.kahn/preprints/kcag.pdf.
308. ↑ "motivic cohomology – Milnor–Bloch–Kato conjecture implies the Beilinson-Lichtenbaum conjecture – MathOverflow". https://mathoverflow.net/q/87162.
309. ↑ Mattman, Thomas W.; Solis, Pablo (2009). "A proof of the Kauffman-Harary Conjecture". Algebraic & Geometric Topology 9 (4): 2027–2039. doi:10.2140/agt.2009.9.2027. Bibcode: 2009arXiv0906.1612M.
310. ↑ Kahn, Jeremy; Markovic, Vladimir (2012). "Immersing almost geodesic surfaces in a closed hyperbolic three manifold". Annals of Mathematics 175 (3): 1127–1190. doi:10.4007/annals.2012.175.3.4.
311. ↑ Lu, Zhiqin (September 2011). "Normal Scalar Curvature Conjecture and its applications". Journal of Functional Analysis 261 (5): 1284–1308. doi:10.1016/j.jfa.2011.05.002.
312. ↑ Dencker, Nils (2006), "The resolution of the Nirenberg–Treves conjecture", Annals of Mathematics 163 (2): 405–444, doi:10.4007/annals.2006.163.405, https://annals.math.princeton.edu/wp-content/uploads/annals-v163-n2-p02.pdf, retrieved 2019-04-07
313. ↑ "Research Awards". https://www.claymath.org/research.
314. ↑ Lewis, A. S.; Parrilo, P. A.; Ramana, M. V. (2005). "The Lax conjecture is true". Proceedings of the American Mathematical Society 133 (9): 2495–2499. doi:10.1090/S0002-9939-05-07752-X.
315. ↑ "Fields Medal – Ngô Bảo Châu". ICM. 19 August 2010. http://www.icm2010.in/prize-winners-2010/fields-medal-ngo-bao-chau. "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."
316. ↑ Voevodsky, Vladimir (2003). "Reduced power operations in motivic cohomology". Publications Mathématiques de l'IHÉS 98: 1–57. doi:10.1007/s10240-003-0009-z. http://archive.numdam.org/item/PMIHES_2003__98__1_0/. Retrieved 2016-03-18.
317. ↑ Baruch, Ehud Moshe (2003). "A proof of Kirillov's conjecture". Annals of Mathematics. Second Series 158 (1): 207–252. doi:10.4007/annals.2003.158.207.
318. ↑ Haas, Bertrand (2002). "A Simple Counterexample to Kouchnirenko's Conjecture". Beiträge zur Algebra und Geometrie 43 (1): 1–8. https://www.emis.de/journals/BAG/vol.43/no.1/b43h1haa.pdf. Retrieved 2016-03-18.
319. ↑ Haiman, Mark (2001). "Hilbert schemes, polygraphs and the Macdonald positivity conjecture". Journal of the American Mathematical Society 14 (4): 941–1006. doi:10.1090/S0894-0347-01-00373-3.
320. ↑ Auscher, Pascal; Hofmann, Steve; Lacey, Michael; McIntosh, Alan; Tchamitchian, Ph. (2002). "The solution of the Kato square root problem for second order elliptic operators on ℝn". Annals of Mathematics. Second Series 156 (2): 633–654. doi:10.2307/3597201.
321. ↑ Barbieri-Viale, Luca; Rosenschon, Andreas; Saito, Morihiko (2003). "Deligne's Conjecture on 1-Motives". Annals of Mathematics 158 (2): 593–633. doi:10.4007/annals.2003.158.593.
322. ↑ Breuil, Christophe; Conrad, Brian; Diamond, Fred; Taylor, 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, ISSN 0894-0347
323. ↑ Luca, Florian (2000). "On a conjecture of Erdős and Stewart". Mathematics of Computation 70 (234): 893–897. doi:10.1090/s0025-5718-00-01178-9. Bibcode: 2001MaCom..70..893L. https://www.ams.org/journals/mcom/2001-70-234/S0025-5718-00-01178-9/S0025-5718-00-01178-9.pdf. Retrieved 2016-03-18.
324. ↑ "The geometry of classical particles". Papers dedicated to Atiyah, Bott, Hirzebruch, and Singer. Surveys in Differential Geometry. 7. Somerville, Massachusetts: International Press. 2000. pp. 1–15. doi:10.4310/SDG.2002.v7.n1.a1.

## Further reading

### Books discussing problems solved since 1995

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

### Books discussing unsolved problems

* Chung, Fan; Graham, Ron (1999). Erdös on Graphs: His Legacy of Unsolved Problems. AK Peters. ISBN 978-1-56881-111-6.
* Croft, Hallard T.; Falconer, Kenneth J.; Guy, Richard K. (1994). Unsolved Problems in Geometry. Springer. ISBN 978-0-387-97506-1. https://archive.org/details/unsolvedproblems0000crof.
* Guy, Richard K. (2004). Unsolved Problems in Number Theory. Springer. ISBN 978-0-387-20860-2.
* Klee, Victor; Wagon, Stan (1996). Old and New Unsolved Problems in Plane Geometry and Number Theory. The Mathematical Association of America. ISBN 978-0-88385-315-3. https://archive.org/details/oldnewunsolvedpr0000klee.
* du Sautoy, Marcus (2003). The Music of the Primes: Searching to Solve the Greatest Mystery in Mathematics. Harper Collins. ISBN 978-0-06-093558-0. https://archive.org/details/musicofprimes00marc.
* Derbyshire, John (2003). Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics. Joseph Henry Press. ISBN 978-0-309-08549-6. https://archive.org/details/primeobsessionbe00derb_0.
* Devlin, Keith (2006). The Millennium Problems – The Seven Greatest Unsolved* Mathematical Puzzles Of Our Time. 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 978-0-691-11748-5.
* Ji, Lizhen; Poon, Yat-Sun; Yau, Shing-Tung (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 978-1-57146-278-7.
* Waldschmidt, Michel (2004). "Open Diophantine Problems". Moscow Mathematical Journal 4 (1): 245–305. doi:10.17323/1609-4514-2004-4-1-245-305. ISSN 1609-3321. http://www.math.jussieu.fr/~miw/articles/pdf/odp.pdf.
* Mazurov, V. D.; Khukhro, E. I. (1 Jun 2015). "Unsolved Problems in Group Theory. The Kourovka Notebook. No. 18 (English version)". arXiv:1401.0300v6 [math.GR].

## External links

* 24 Unsolved Problems and Rewards for them
* List of links to unsolved problems in mathematics, prizes and research
* Open Problem Garden
* AIM Problem Lists
* Unsolved Problem of the Week Archive. MathPro Press.
* Ball, John M.. "Some Open Problems in Elasticity". https://people.maths.ox.ac.uk/ball/Articles in Conference Proceedings and Books/JMB 2002 re Marsden 60th.pdf.
* Constantin, Peter. "Some open problems and research directions in the mathematical study of fluid dynamics". https://web.math.princeton.edu/~const/2k.pdf.
* Serre, Denis. "Five Open Problems in Compressible Mathematical Fluid Dynamics". http://www.umpa.ens-lyon.fr/~serre/DPF/Ouverts.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". https://web.math.princeton.edu/~aizenman/OpenProblems_MathPhys/OPlist.html.
* Barry Simon's 15 Problems in Mathematical Physics
* Alexandre Eremenko. Unsolved problems in Function Theory
* Erdos Problems collection

* v
* t
* e

Unsolved problems by discipline

* Astronomy
* Biology
* Chemistry
* Computer science
* Economics
* Geoscience
* Information theory
* Linguistics
* Mathematics
* Medicine
* Philosophy
* Physics
* Statistics

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/List of unsolved problems in mathematics. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=List_of_unsolved_problems_in_mathematics&oldid=4566397"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template