Home

Open Problems


TitleAuthor(s)Imp.¹Rec.²sort iconArea » Topic » SubtopicPosted by
Choosability of Graph PowersNoel✭✭1Graph Theory » Coloring » Vertex coloringJon Noel
Almost all non-Hamiltonian 3-regular graphs are 1-connectedHaythorpe✭✭1Graph Theory » Basic G.T.mhaythorpe
Partitioning the Projective PlaneNoel✭✭1GeometryJon Noel
Fractional HadwigerHarvey; Reed; Seymour; Wood✭✭1Graph TheoryDavid Wood
Forcing a 2-regular minorReed; Wood✭✭1Graph Theory » Basic G.T. » MinorsDavid Wood
Generalised Empty Hexagon ConjectureWood✭✭1GeometryDavid Wood
List Colourings of Complete Multipartite Graphs with 2 Big PartsAllagan✭✭1Graph Theory » Coloring » Vertex coloringJon Noel
Saturated $k$-Sperner Systems of Minimum SizeMorrison; Noel; Scott✭✭1Combinatorics » PosetsJon Noel
Chromatic number of associahedronFabila-Monroy; Flores-Penaloza; Huemer; Hurtado; Urrutia; Wood✭✭1GeometryDavid Wood
Convex Equipartitions with Extreme PerimeterNandakumar✭✭1GeometryNandakumar
Weak saturation of the cube in the cliqueMorrison; Noel✭1Graph Theory » Extremal G.T.Jon Noel
Monochromatic vertex colorings inherited from Perfect Matchings✭✭✭1Graph TheoryMario Krenn
Singmaster's conjectureSingmaster✭✭1Number Theory » Combinatorial N.T.Zach Teitler
3-Edge-Coloring ConjectureArthur; Hoffmann-Ostenhof✭✭✭1Graph Theoryarthur

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

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

Syndicate content