Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Graceful Tree Conjecture
✭✭✭
0
Graph Theory
»
Coloring
»
Labeling
kintali
Jacob Palis Conjecture(Finitude of Attractors)(Dynamical Systems)
✭✭✭✭
0
Topology
Jailton Viana
$C^r$ Stability Conjecture
Palis
;
Smale
✭✭✭✭
0
Analysis
m n
(m,n)-cycle covers
Celmins
;
Preissmann
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
2-accessibility of primes
Landman
;
Robertson
✭✭
0
Combinatorics
vjungic
2-colouring a graph without a monochromatic maximum clique
Hoang
;
McDiarmid
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
3 is a primitive root modulo primes of the form 16 q^4 + 1, where q>3 is prime
✭✭
0
Number Theory
princeps
3-accessibility of Fibonacci numbers
Landman
;
Robertson
✭✭
0
Combinatorics
vjungic
3-Colourability of Arrangements of Great Circles
Felsner
;
Hurtado
;
Noy
;
Streinu
✭✭
1
Graph Theory
»
Topological G.T.
»
Coloring
David Wood
3-Decomposition Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
Graph Theory
arthur
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Graph Theory
arthur
3-flow conjecture
Tutte
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
4-connected graphs are not uniquely hamiltonian
Fleischner
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
4-flow conjecture
Tutte
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
4-regular 4-chromatic graphs of high girth
Grunbaum
✭✭
0
Graph Theory
»
Coloring
mdevos
5-flow conjecture
Tutte
✭✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
5-local-tensions
DeVos
✭✭
0
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
57-regular Moore graph?
Hoffman
;
Singleton
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
A conjecture about direct product of funcoids
Porton
✭✭
0
Topology
porton
A conjecture on iterated circumcentres
Goddyn
✭✭
1
Geometry
mdevos
A diagram about funcoids and reloids
Porton
✭✭
0
Topology
porton
A discrete iteration related to Pierce expansions
Shallit
✭✭
1
Number Theory
shallit
A funcoid related to directed topological spaces
Porton
✭✭
0
Topology
porton
A generalization of Vizing's Theorem?
Rosenfeld
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
A gold-grabbing game
Rosenfeld
✭✭
0
Graph Theory
»
Graph Algorithms
mdevos
A homomorphism problem for flows
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
A nowhere-zero point in a linear mapping
Jaeger
✭✭✭
0
Combinatorics
»
Matrices
mdevos
A sextic counterexample to Euler's sum of powers conjecture
Euler
✭✭
1
Number Theory
»
Computational N.T.
maxal
Acyclic edge-colouring
Fiamcik
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Acyclic list colouring of planar graphs.
Borodin
;
Fon-Der-Flasss
;
Kostochka
;
Raspaud
;
Sopena
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Ádám's Conjecture
Ádám
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Aharoni-Berger conjecture
Aharoni
;
Berger
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
Alexa's Conjecture on Primality
Alexa
✭✭
0
Number Theory
princeps
Algebraic independence of pi and e
✭✭✭
0
Number Theory
porton
Algorithm for graph homomorphisms
Fomin
;
Heggernes
;
Kratsch
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
jfoniok
Almost all non-Hamiltonian 3-regular graphs are 1-connected
Haythorpe
✭✭
1
Graph Theory
»
Basic G.T.
mhaythorpe
Another conjecture about reloids and funcoids
Porton
✭✭
0
Topology
porton
Antichains in the cycle continuous order
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Approximation ratio for k-outerplanar graphs
Bentz
✭✭
0
Graph Theory
jcmeyer
Approximation Ratio for Maximum Edge Disjoint Paths problem
Bentz
✭✭
0
Graph Theory
jcmeyer
Arc-disjoint directed cycles in regular directed graphs
Alon
;
McDiarmid
;
Molloy
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Arc-disjoint out-branching and in-branching
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Arc-disjoint strongly connected spanning subdigraphs
Bang-Jensen
;
Yeo
✭✭
0
Graph Theory
fhavet
Are all Fermat Numbers square-free?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Are all Mersenne Numbers with prime exponent square-free?
✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
Are almost all graphs determined by their spectrum?
✭✭✭
0
Graph Theory
mdevos
Are different notions of the crossing number the same?
Pach
;
Tóth
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
cibulka
Are there an infinite number of lucky primes?
Lazarus: Gardiner: Metropolis
;
Ulam
✭
1
Number Theory
»
Additive N.T.
cubola zaruka
Are there infinite number of Mersenne Primes?
✭✭✭✭
0
Number Theory
»
Analytic N.T.
kurtulmehtap
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