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; Noel1Graph 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
Cores of Cayley graphsSamal✭✭0Graph Theory » Coloring » HomomorphismsRobert Samal
5-flow conjectureTutte✭✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
4-flow conjectureTutte✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
3-flow conjectureTutte✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Jaeger's modular orientation conjectureJaeger✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Bouchet's 6-flow conjectureBouchet✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
The three 4-flows conjectureDeVos✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
A homomorphism problem for flowsDeVos✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Real roots of the flow polynomialWelsh✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Unit vector flowsJain✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Cycle double cover conjectureSeymour; Szekeres✭✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
The circular embedding conjectureHaggard✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
(m,n)-cycle coversCelmins; Preissmann✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
Faithful cycle coversSeymour✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
Decomposing eulerian graphs✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
The Berge-Fulkerson conjectureBerge; Fulkerson✭✭✭✭0Graph Theory » Basic G.T. » Matchingsmdevos
Petersen coloring conjectureJaeger✭✭✭0Graph Theory » Coloring » Edge coloringmdevos
Packing T-joinsDeVos✭✭0Graph Theory » Coloring » Edge coloringmdevos
Acyclic edge-colouringFiamcik✭✭0Graph Theory » Coloring » Edge coloringmdevos
Partitioning edge-connectivityDeVos✭✭0Graph Theory » Basic G.T. » Connectivitymdevos
A nowhere-zero point in a linear mappingJaeger✭✭✭0Combinatorics » Matricesmdevos
The additive basis conjectureJaeger; Linial; Payan; Tarsi✭✭✭0Combinatorics » Matricesmdevos
The permanent conjectureKahn✭✭0Combinatorics » Matricesmdevos
The Alon-Tarsi basis conjectureAlon; Linial; Meshulam✭✭0Combinatorics » Matricesmdevos
Highly connected graphs with no K_n minorThomas✭✭✭0Graph Theory » Basic G.T. » Minorsmdevos
Jorgensen's ConjectureJorgensen✭✭✭0Graph Theory » Basic G.T. » Minorsmdevos
Olson's ConjectureOlson✭✭0Number Theory » Combinatorial N.T.mdevos
Few subsequence sums in Z_n x Z_nBollobas; Leader✭✭0Number Theory » Combinatorial N.T.mdevos
The stubborn list partition problemCameron; Eschen; Hoang; Sritharan✭✭0Graph Theory » Graph Algorithmsmdevos
57-regular Moore graph?Hoffman; Singleton✭✭✭0Graph Theory » Algebraic G.T.mdevos
Hamiltonian paths and cycles in vertex transitive graphsLovasz✭✭✭0Graph Theory » Algebraic G.T.mdevos
The Erdös-Hajnal ConjectureErdos; Hajnal✭✭✭0Graph Theory » Extremal G.T.mdevos
Subset-sums equality (pigeonhole version)✭✭✭0Theoretical Comp. Sci. » Complexitymdevos
Graham's conjecture on tree reconstructionGraham✭✭0Graph Theory » Basic G.T.mdevos
Ryser's conjectureRyser✭✭✭0Graph Theory » Hypergraphsmdevos
Pentagon problemNesetril✭✭✭0Graph Theory » Coloring » HomomorphismsRobert Samal
Syndicate content