Open Problems


TitleAuthor(s)Imp.¹sort iconRec.²Area » Topic » SubtopicPosted by
A diagram about funcoids and reloidsPorton✭✭0Topologyporton
Which outer reloids are equal to inner onesPorton✭✭0Topologyporton
Waring rank of determinantTeitler✭✭0AlgebraZach Teitler
Singmaster's conjectureSingmaster✭✭1Number Theory » Combinatorial N.T.Zach Teitler
Edge-Unfolding Convex PolyhedraShephard✭✭0GeometryErik Demaine
What is the largest graph of positive curvature?DeVos; Mohar1Graph Theory » Topological G.T. » Planar graphsmdevos
End-Devouring RaysGeorgakopoulos1Graph Theory » Infinite GraphsAgelos
Combinatorial covering designsGordon; Mills; Rödl; Schönheim0Combinatorics » DesignsPseudonym
Termination of the sixth Goodstein SequenceGraham0Logicmdevos
Criterion for boundedness of power seriesRüdinger1Analysisandreasruedinger
Are there an infinite number of lucky primes?Lazarus: Gardiner: Metropolis; Ulam1Number Theory » Additive N.T.cubola zaruka
Point sets with no empty pentagonWood1GeometryDavid Wood
Special PrimesGeorge BALAN1Number Theorymaththebalans
Covering powers of cycles with equivalence subgraphs0Graph TheoryAndrew King
Strict inequalities for products of filtersPorton0Topologyporton
Obstacle number of planar graphsAlpert; Koch; Laison1Graph TheoryAndrew King
Length of surreal productGonshor1CombinatoricsLukáš Lánský
Circular choosability of planar graphsMohar0Graph Theory » Coloring » Homomorphismsrosskang
Mixing Circular ColouringsBrewster; Noel1Graph Theory » Coloring » Vertex coloringJon Noel
Melnikov's valency-variety problemMelnikov0Graph Theory » Coloring » Vertex coloringasp
Weak saturation of the cube in the cliqueMorrison; Noel1Graph Theory » Extremal G.T.Jon Noel
Syndicate content