Home

Open Problem Garden

  • Help
  • About
  • Contact
  login/create account
Home

Open Problems


TitleAuthor(s)Imp.¹sort iconRec.²Area » Topic » SubtopicPosted by
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.

« first‹ previous…789101112131415
Syndicate content

Navigate

  • Subject
    • Algebra (295)
    • 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

  • Nowhere-zero flows
  • Shuffle-Exchange Conjecture
  • Algebra
  • Seagull problem
  • Solution to the Lonely Runner Conjecture
more
Powered by  Drupal                       Hosted by  CSI of Charles University                       Content distributed under                       Disclaimer