This is a dynamic list and may never be able to satisfy particular standards for completeness. You can help by editing the page to add missing items, with references to reliable sources.
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.
Lists of unsolved problems in mathematics
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.
The Kourovka Notebook (Russian: Коуровская тетрадь) is a collection of unsolved problems in group theory, first published in 1965 and updated many times since.[15]
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.[16][17][18]
Casas-Alvero conjecture: if a polynomial of degree defined over a field of characteristic has a factor in common with its first through -th derivative, then must be the -th power of a linear polynomial?
Pierce–Birkhoff conjecture: every piecewise-polynomial is the maximum of a finite set of minimums of finite collections of polynomials.
Rota's basis conjecture: for matroids of rank with disjoint bases , it is possible to create an matrix whose rows are and whose columns are also bases.
The free Burnside group is finite; in its Cayley graph, shown here, each of its 27 elements is represented by a vertex. The question of which other groups are finite remains open.
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[23]
Herzog–Schönheim conjecture: if a finite system of left cosets of subgroups of a group form a partition of , 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?
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
The Dittert conjecture concerning the maximum achieved by a particular function of matrices with real, nonnegative entries satisfying a summation condition
The lonely runner conjecture – if runners with pairwise distinct speeds run round a track of unit length, will every runner be "lonely" (that is, be at least a distance from each other runner) at some time?[28]
Map folding – various problems in map folding and stamp folding.
No-three-in-line problem – how many points can be placed in the grid so that no three of them lie on a line?
The sunflower conjecture – can the number of size sets required for the existence of a sunflower of sets be bounded by an exponential function in for every fixed ?
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[30]
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?
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)[40]
Borsuk's problem on upper and lower bounds for the number of smaller-diameter subsets needed to cover a boundedn-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?[46]
Reinhardt's conjecture: the smoothed octagon has the lowest maximum packing density of all centrally-symmetric convex plane sets[49]
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.
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.[53]
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[54]
The Hopf conjectures relating the curvature and Euler characteristic of higher-dimensional Riemannian manifolds[55]
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[57]
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[71]
Borromean rings — are there three unknotted space curves, not all three circles, which cannot be arranged to form this link?[72]
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[79]
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?[84]
Does every higher-dimensional tiling by translations of convex polytope tiles have an affine transformation taking it to a Voronoi diagram?[85]
Suppose Alice has a winning strategy for the vertex coloring game on a graph with colors. Does she have one for colors?[95]
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.
Turán's brick factory problem – Is there a drawing of any complete bipartite graph with fewer crossings than the number given by Zarankiewicz?[111]
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?[112]
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.[125]
Characterise word-representable near-triangulations containing the complete graph K4 (such a characterisation is known for K4-free planar graphs[137])
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[138]
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?[141]
The main gap conjecture, e.g. for uncountable first order theories, for AECs, and for -saturated models of a countable theory.[145]
Shelah's categoricity conjecture for : If a sentence is categorical above the Hanf number then it is categorical in all cardinals above the Hanf number.[145]
Shelah's eventual categoricity conjecture: For every cardinal there exists a cardinal such that if an AECK with LS(K) is categorical in a cardinal above then it is categorical in all cardinals above .[145][146]
The stable field conjecture: every infinite field with a stable first-order theory is separably closed.
The stable forking conjecture for simple theories[147]
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?[148]
The universality spectrum problem: Is there a first-order theory whose universality spectrum is minimum?[149]
Assume K is the class of models of a countable first order theory omitting countably many types. If K has a model of cardinality does it have a model of cardinality continuum?[150]
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 , is it categorical in every cardinal?[151][152]
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?[153]
Is the theory of the field of Laurent series over 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?[154]
Determine the structure of Keisler's order.[155][156]
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.
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