Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
A funcoid related to directed topological spaces
Porton
✭✭
0
Topology
porton
A discrete iteration related to Pierce expansions
Shallit
✭✭
1
Number Theory
shallit
A diagram about funcoids and reloids
Porton
✭✭
0
Topology
porton
A conjecture on iterated circumcentres
Goddyn
✭✭
1
Geometry
mdevos
A conjecture about direct product of funcoids
Porton
✭✭
0
Topology
porton
57-regular Moore graph?
Hoffman
;
Singleton
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
5-local-tensions
DeVos
✭✭
0
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
5-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
4-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
3-flow conjecture
Tutte
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Graph Theory
arthur
3-Decomposition Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
Graph Theory
arthur
3-Colourability of Arrangements of Great Circles
Felsner
;
Hurtado
;
Noy
;
Streinu
✭✭
1
Graph Theory
»
Topological G.T.
»
Coloring
David Wood
3-accessibility of Fibonacci numbers
Landman
;
Robertson
✭✭
0
Combinatorics
vjungic
3 is a primitive root modulo primes of the form 16 q^4 + 1, where q>3 is prime
✭✭
0
Number Theory
princeps
2-colouring a graph without a monochromatic maximum clique
Hoang
;
McDiarmid
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
2-accessibility of primes
Landman
;
Robertson
✭✭
0
Combinatorics
vjungic
(m,n)-cycle covers
Celmins
;
Preissmann
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
$C^r$ Stability Conjecture
Palis
;
Smale
✭✭✭✭
0
Analysis
m n
Jacob Palis Conjecture(Finitude of Attractors)(Dynamical Systems)
✭✭✭✭
0
Topology
Jailton Viana
Graceful Tree Conjecture
✭✭✭
0
Graph Theory
»
Coloring
»
Labeling
kintali
« first
‹ previous
1
2
3
4
5
6
7
8
9
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