Open Problems


Titlesort iconAuthor(s)Imp.¹Rec.²Area » Topic » SubtopicPosted by
A discrete iteration related to Pierce expansionsShallit✭✭1Number Theoryshallit
A diagram about funcoids and reloidsPorton✭✭0Topologyporton
A conjecture on iterated circumcentresGoddyn✭✭1Geometrymdevos
A conjecture about direct product of funcoidsPorton✭✭0Topologyporton
57-regular Moore graph?Hoffman; Singleton✭✭✭0Graph Theory » Algebraic G.T.mdevos
5-local-tensionsDeVos✭✭0Graph Theory » Topological G.T. » Coloringmdevos
5-flow conjectureTutte✭✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
4-regular 4-chromatic graphs of high girthGrunbaum✭✭0Graph Theory » Coloringmdevos
4-flow conjectureTutte✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
4-connected graphs are not uniquely hamiltonianFleischner✭✭0Graph Theory » Basic G.T. » Cyclesfhavet
3-flow conjectureTutte✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
3-Decomposition ConjectureArthur; Hoffmann-Ostenhof✭✭✭0Graph Theoryarthur
3-Colourability of Arrangements of Great CirclesFelsner; Hurtado; Noy; Streinu✭✭1Graph Theory » Topological G.T. » ColoringDavid Wood
3-accessibility of Fibonacci numbersLandman; Robertson✭✭0Combinatoricsvjungic
3 is a primitive root modulo primes of the form 16 q^4 + 1, where q>3 is prime✭✭0Number Theoryprinceps
2-colouring a graph without a monochromatic maximum cliqueHoang; McDiarmid✭✭0Graph Theory » Coloring » Vertex coloringJon Noel
2-accessibility of primesLandman; Robertson✭✭0Combinatoricsvjungic
(m,n)-cycle coversCelmins; Preissmann✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
$C^r$ Stability ConjecturePalis; Smale✭✭✭✭0Analysism n
Jacob Palis Conjecture(Finitude of Attractors)(Dynamical Systems)✭✭✭✭0TopologyJailton Viana
Graceful Tree Conjecture✭✭✭0Graph Theory » Coloring » Labelingkintali
Syndicate content