Home

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; Mohar✭1Graph Theory » Topological G.T. » Planar graphsmdevos
End-Devouring RaysGeorgakopoulos✭1Graph Theory » Infinite GraphsAgelos
Combinatorial covering designsGordon; Mills; Rödl; Schönheim✭0Combinatorics » DesignsPseudonym
Termination of the sixth Goodstein SequenceGraham✭0Logicmdevos
Criterion for boundedness of power seriesRüdinger✭1Analysisandreasruedinger
Are there an infinite number of lucky primes?Lazarus: Gardiner: Metropolis; Ulam✭1Number Theory » Additive N.T.cubola zaruka
Point sets with no empty pentagonWood✭1GeometryDavid Wood
Special PrimesGeorge BALAN✭1Number Theorymaththebalans
Covering powers of cycles with equivalence subgraphs✭0Graph TheoryAndrew King
Strict inequalities for products of filtersPorton✭0Topologyporton
Obstacle number of planar graphsAlpert; Koch; Laison✭1Graph TheoryAndrew King
Length of surreal productGonshor✭1CombinatoricsLukáš Lánský
Circular choosability of planar graphsMohar✭0Graph Theory » Coloring » Homomorphismsrosskang
Mixing Circular ColouringsBrewster; Noel✭1Graph Theory » Coloring » Vertex coloringJon Noel
Melnikov's valency-variety problemMelnikov✭0Graph Theory » Coloring » Vertex coloringasp
Weak saturation of the cube in the cliqueMorrison; Noel✭1Graph Theory » Extremal G.T.Jon Noel

Imp.¹: Importance (Low ✭, Medium ✭✭, High ✭✭✭, Outstanding ✭✭✭✭)
Rec.²: Recommended for undergraduates.

Note: Resolved problems from this section may be found in Solved problems.

Syndicate content