Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
Graph Theory
zitterbewegung
F_d versus F_{d+1}
Krajicek
✭✭✭
0
Logic
zitterbewegung
P vs. NP
Cook
;
Levin
✭✭✭✭
0
Theoretical Comp. Sci.
»
Algorithms
zitterbewegung
Waring rank of determinant
Teitler
✭✭
0
Algebra
Zach Teitler
Singmaster's conjecture
Singmaster
✭✭
1
Number Theory
»
Combinatorial N.T.
Zach Teitler
Finite Lattice Representation Problem
✭✭✭✭
0
Algebra
williamdemeo
Which lattices occur as intervals in subgroup lattices of finite groups?
✭✭✭✭
0
Group Theory
williamdemeo
Matching cut and girth
✭✭
0
Graph Theory
w
Is Skewes' number e^e^e^79 an integer?
✭✭
0
Number Theory
»
Analytic N.T.
VladimirReshetnikov
The large sets conjecture
Brown
;
Graham
;
Landman
✭✭✭
0
Combinatorics
»
Ramsey Theory
vjungic
Long rainbow arithmetic progressions
Fox
;
Jungic
;
Mahdian
;
Nesetril
;
Radoicic
✭✭
0
Combinatorics
vjungic
Rainbow AP(4) in an almost equinumerous coloring
Conlon
✭✭
0
Combinatorics
vjungic
Monotone 4-term Arithmetic Progressions
Davis
;
Entringer
;
Graham
;
Simmons
✭✭
0
Combinatorics
vjungic
2-accessibility of primes
Landman
;
Robertson
✭✭
0
Combinatorics
vjungic
3-accessibility of Fibonacci numbers
Landman
;
Robertson
✭✭
0
Combinatorics
vjungic
Shuffle-Exchange Conjecture (graph-theoretic form)
Beneš
;
Folklore
;
Stone
✭✭✭
0
Graph Theory
Vadim Lioubimov
Shuffle-Exchange Conjecture
Beneš
;
Folklore
;
Stone
✭✭✭
0
Combinatorics
Vadim Lioubimov
Beneš Conjecture
Beneš
✭✭✭
0
Combinatorics
Vadim Lioubimov
Beneš Conjecture (graph-theoretic form)
Beneš
✭✭✭
0
Graph Theory
Vadim Lioubimov
Perfect cuboid
✭✭
0
Number Theory
»
Computational N.T.
tsihonglau
Primitive pythagorean n-tuple tree
✭✭
0
Number Theory
tsihonglau
KPZ Universality Conjecture
✭✭✭
0
Probability
Tomas Kojar
Inequality for square summable complex series
Retkes
✭✭
1
Analysis
tigris35711
Wide partition conjecture
Chow
;
Taylor
✭✭
0
Combinatorics
tchow
Kneser–Poulsen conjecture
Kneser
;
Poulsen
✭✭✭
0
Geometry
tchow
Hamiltonicity of Cayley graphs
Rapaport-Strasser
✭✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
tchow
Frankl's union-closed sets conjecture
Frankl
✭✭
0
Graph Theory
»
Hypergraphs
tchow
Edge list coloring conjecture
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
tchow
Inverse Galois Problem
Hilbert
✭✭✭✭
0
Group Theory
tchow
Invariant subspace problem
✭✭✭
0
Analysis
tchow
Shannon capacity of the seven-cycle
✭✭✭
0
Graph Theory
tchow
Linear Hypergraphs with Dimension 3
Ossona de Mendez
;
Rosenstiehl
;
de Fraysseix
✭✭
0
Graph Theory
»
Topological G.T.
»
Drawings
taxipom
Roller Coaster permutations
Ahmed
;
Snevily
✭✭✭
0
Combinatorics
Tanbir Ahmed
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
Graph Theory
»
Extremal G.T.
shudeshijie
A discrete iteration related to Pierce expansions
Shallit
✭✭
1
Number Theory
shallit
Imbalance conjecture
Kozerenko
✭✭
0
Graph Theory
Sergiy Kozerenko
Graphs of exact colorings
✭✭
0
Algebra
sabisood
Smooth 4-dimensional Schoenflies problem
Alexander
✭✭✭✭
0
Topology
rybu
Smooth 4-dimensional Poincare conjecture
Poincare
;
Smale
;
Stallings
✭✭✭✭
0
Topology
rybu
Slice-ribbon problem
Fox
✭✭✭✭
0
Topology
rybu
Realisation problem for the space of knots in the 3-sphere
Budney
✭✭
0
Topology
rybu
Which homology 3-spheres bound homology 4-balls?
Ancient/folklore
✭✭✭✭
0
Topology
rybu
Fundamental group torsion for subsets of Euclidean 3-space
Ancient/folklore
✭✭
0
Topology
rybu
Which compact boundaryless 3-manifolds embed smoothly in the 4-sphere?
Kirby
✭✭✭
0
Topology
rybu
What is the homotopy type of the group of diffeomorphisms of the 4-sphere?
Smale
✭✭✭✭
0
Topology
rybu
Is there an algorithm to determine if a triangulated 4-manifold is combinatorially equivalent to the 4-sphere?
Novikov
✭✭✭
0
Topology
rybu
Unsolvability of word problem for 2-knot complements
Gordon
✭✭✭
0
Topology
rybu
The 4x5 chessboard complex is the complement of a link, which link?
David Eppstein
✭✭
0
Topology
rybu
Elementary symmetric of a sum of matrices
✭✭✭
0
Algebra
rscosa
Circular choosability of planar graphs
Mohar
✭
0
Graph Theory
»
Coloring
»
Homomorphisms
rosskang
1
2
3
4
5
6
7
8
9
next ›
last »
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Chords of longest cycles
Do any three longest paths in a connected graph have a vertex in common?
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
more