Category
Problem Set
Status
Linear Arboricity Conjecture
Can every graph with maximum degree Δ be decomposed into at most ⌈(Δ+1)/2⌉ linear forests?...
Lovász Conjecture
Does every finite connected vertex-transitive graph contain a Hamiltonian path?...
Oberwolfach Problem
For which 2-regular graphs H can the complete graph be decomposed into edge-disjoint copies of H?...
Cubic Graph Pathwidth
What is the maximum pathwidth of an n-vertex cubic graph?...
Snake-in-the-Box Problem
What is the longest induced path in an n-dimensional hypercube graph?...
Sumner's Conjecture
Does every (2n-2)-vertex tournament contain every n-vertex oriented tree?...
Tuza's Conjecture
Can the edges of any graph be covered by at most 2ν triangles, where ν is the maximum size of a triangle packing?...
Unfriendly Partition Conjecture
Does every countable graph admit a partition where every vertex has at least as many neighbors outside its part as inside?...
Zarankiewicz Problem
What is the maximum number of edges in a bipartite graph on (m,n) vertices with no complete bipartite subgraph $K_{s,t}$?...
Vizing's Conjecture
For the Cartesian product of graphs $G \square H$, is the domination number at least $\gamma(G) \cdot \gamma(H)$?...
Hamiltonian Decomposition of Hypergraphs
Do complete k-uniform hypergraphs admit Hamiltonian decompositions into tight cycles?...
Word-Representable Graphs: Letter Copies Bound
Are there graphs on n vertices requiring more than floor(n/2) copies of each letter for word-representation?...
Characterization of Word-Representable Planar Graphs
Characterize which planar graphs are word-representable....
Word-Representable Graphs: Forbidden Subgraph Characterization
Characterize word-representable graphs in terms of forbidden induced subgraphs....
Word-Representable Near-Triangulations
Characterize word-representable near-triangulations containing K₄....
Representation Number 3 Classification
Classify graphs with representation number exactly 3....
Crown Graphs and Longest Word-Representants
Among bipartite graphs, do crown graphs require the longest word-representants?...
Line Graphs of Non-Word-Representable Graphs
Is the line graph of a non-word-representable graph always non-word-representable?...
Translating Graph Problems to Word Problems
Which hard graph problems can be efficiently solved by translating graphs to their word representations?...
Imbalance Conjecture
If every edge has imbalance ≥1, is the multiset of edge imbalances always graphic?...
Implicit Graph Conjecture
Do slowly-growing hereditary graph families admit implicit representations?...
Ryser's Conjecture
For r-partite r-uniform hypergraphs, is the vertex cover number at most (r-1) times the matching number?...
Second Neighborhood Problem
Does every oriented graph have a vertex with at least as many vertices at distance 2 as at distance 1?...
Teschner's Bondage Number Conjecture
Is the bondage number of a graph always ≤ 3Δ/2, where Δ is the maximum degree?...
Tutte's 5-Flow Conjecture
Does every bridgeless graph have a nowhere-zero 5-flow?...
Tutte's 4-Flow Conjecture for Petersen-Minor-Free Graphs
Does every Petersen-minor-free bridgeless graph have a nowhere-zero 4-flow?...
Woodall's Conjecture
Is the minimum dicut size equal to the maximum number of disjoint dijoins in a directed graph?...
Birch-Tate Conjecture
Relate the order of the center of the Steinberg group of the ring of integers to the Dedekind zeta function....
Casas-Alvero Conjecture
If a polynomial of degree d over a field of characteristic 0 shares a factor with each of its first d-1 derivatives, must it be $(x-a)^d$?...
Connes Embedding Problem
Can every finite von Neumann algebra be embedded into an ultrapower of the hyperfinite II₁ factor?...
Crouzeix's Conjecture
Is $\|f(A)\| \leq 2 \sup_{z \in W(A)} |f(z)|$ for any matrix A and analytic function f on the numerical range W(A)?...
Determinantal Conjecture
Characterize the determinant of the sum of two normal matrices....
Eilenberg-Ganea Conjecture
Does every group with cohomological dimension 2 have a 2-dimensional Eilenberg-MacLane space K(G,1)?...
Farrell-Jones Conjecture
Are the assembly maps in algebraic K-theory and L-theory isomorphisms?...
Finite Lattice Representation Problem
Is every finite lattice isomorphic to the congruence lattice of some finite algebra?...
Hadamard Matrix Conjecture
Does a Hadamard matrix of order 4k exist for every positive integer k?...
Köthe Conjecture
If a ring has no nil two-sided ideal besides {0}, does it also have no nil one-sided ideal besides {0}?...
Perfect Cuboid
Does there exist a perfect cuboid—a rectangular parallelepiped with integer edges, face diagonals, and space diagonal?...
Rota's Basis Conjecture
Given n bases of an n-dimensional matroid, can we find n disjoint rainbow bases?...
Cherlin-Zilber Conjecture
Is every simple group with a stable first-order theory an algebraic group over an algebraically closed field?...
Generalized Star Height Problem
Can all regular languages be expressed with generalized regular expressions having bounded star height?...
Hilbert's Tenth Problem for Number Fields
For which number fields is there an algorithm to determine if a Diophantine equation has solutions?...
Vaught Conjecture
Does every complete first-order theory in a countable language have countably many, $\aleph_0$, or $2^{\aleph_0}$ countable models?...
Tarski's Exponential Function Problem
Is the theory of the real numbers with addition, multiplication, and exponentiation decidable?...
Stable Field Conjecture
Is every infinite field with a stable first-order theory separably closed?...
Henson Graphs Finite Model Property
Do Henson graphs have the finite model property?...
O-Minimal Theory with Trans-Exponential Growth
Does there exist an o-minimal first-order theory with a trans-exponential (rapid growth) function?...
Infinite Minimal Field Algebraic Closure
Is every infinite minimal field of characteristic zero algebraically closed?...
Keisler's Order
Determine the structure of Keisler's order on first-order theories....
Serre's Conjecture II
For simply connected semisimple algebraic groups over fields of cohomological dimension ≤2, is $H^1(F,G) = 0$?...