Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Shannon capacity of the seven-cycle
✭✭✭
0
Graph Theory
tchow
Refuting random 3SAT-instances on $O(n)$ clauses (weak form)
Feige
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Hardness of Approximation
cwenner
P vs. PSPACE
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
cwenner
Inequality of the means
✭✭✭
0
Geometry
mdevos
Graphs with a forbidden induced tree are chi-bounded
Gyarfas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Crossing numbers and coloring
Albertson
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
mdevos
Shuffle-Exchange Conjecture (graph-theoretic form)
Beneš
;
Folklore
;
Stone
✭✭✭
0
Graph Theory
Vadim Lioubimov
Are different notions of the crossing number the same?
Pach
;
Tóth
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
cibulka
Which compact boundaryless 3-manifolds embed smoothly in the 4-sphere?
Kirby
✭✭✭
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
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
Unsolvability of word problem for 2-knot complements
Gordon
✭✭✭
0
Topology
rybu
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
arthur
Polignac's Conjecture
de Polignac
✭✭✭
0
Number Theory
Hugh Barker
Vertex Coloring of graph fractional powers
Iradmusa
✭✭✭
1
Graph Theory
Iradmusa
Euler-Mascheroni constant
✭✭✭
0
Number Theory
»
Analytic N.T.
Juggernaut
Durer's Conjecture
Durer
;
Shephard
✭✭✭
1
Geometry
»
Polytopes
dmoskovich
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Ádám's Conjecture
Ádám
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Decomposing a connected graph into paths.
Gallai
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Paths
fhavet
Acyclic list colouring of planar graphs.
Borodin
;
Fon-Der-Flasss
;
Kostochka
;
Raspaud
;
Sopena
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
The Bollobás-Eldridge-Catlin Conjecture on graph packing
✭✭✭
0
Graph Theory
»
Extremal G.T.
asp
Are almost all graphs determined by their spectrum?
✭✭✭
0
Graph Theory
mdevos
P vs. BPP
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Derandomization
Charles R Great...
Are all Fermat Numbers square-free?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Are there only finite Fermat Primes?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Roller Coaster permutations
Ahmed
;
Snevily
✭✭✭
0
Combinatorics
Tanbir Ahmed
Are all Mersenne Numbers with prime exponent square-free?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
3-Decomposition Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
Graph Theory
arthur
Monochromatic reachability in arc-colored digraphs
Sands
;
Sauer
;
Woodrow
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
Graph Theory
arthur
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Graph Theory
Mario Krenn
Sidorenko's Conjecture
Sidorenko
✭✭✭
0
Graph Theory
Jon Noel
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Extremal G.T.
Jon Noel
Several ways to apply a (multivalued) multiargument function to a family of filters
Porton
✭✭✭
0
Topology
porton
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Graph Theory
arthur
KPZ Universality Conjecture
✭✭✭
0
Probability
Tomas Kojar
5-flow conjecture
Tutte
✭✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Cycle double cover conjecture
Seymour
;
Szekeres
✭✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
The Berge-Fulkerson conjecture
Berge
;
Fulkerson
✭✭✭✭
0
Graph Theory
»
Basic G.T.
»
Matchings
mdevos
Diagonal Ramsey numbers
Erdos
✭✭✭✭
0
Combinatorics
»
Ramsey Theory
mdevos
The Erdos-Turan conjecture on additive bases
Erdos
;
Turan
✭✭✭✭
0
Number Theory
»
Additive N.T.
mdevos
« first
‹ previous
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