Home

Open Problems


TitleAuthor(s)sort iconImp.¹Rec.²Area » Topic » SubtopicPosted by
Hamiltonian cycles in powers of infinite graphsGeorgakopoulos✭✭0Graph Theory » Infinite GraphsRobert Samal
End-Devouring RaysGeorgakopoulos✭1Graph Theory » Infinite GraphsAgelos
Geodesic cycles and Tutte's TheoremGeorgakopoulos; Sprüssel✭✭1Graph Theory » Basic G.T. » CyclesAgelos
Special PrimesGeorge BALAN✭1Number Theorymaththebalans
Circular coloring triangle-free subcubic planar graphsGhebleh; Zhu✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Giuga's Conjecture on PrimalityGiuseppe Giuga✭✭0Number Theoryprinceps
A conjecture on iterated circumcentresGoddyn✭✭1Geometrymdevos
Complexity of square-root sumGoemans✭✭0Theoretical Comp. Sci. » Complexityabie
Goldbach conjectureGoldbach✭✭✭✭0Number Theory » Additive N.T.Benschop
Goldberg's conjectureGoldberg✭✭✭0Graph Theory » Coloring » Edge coloringmdevos
What is the smallest number of disjoint spanning trees made a graph HamiltonianGoldengorin✭✭0Graph Theory » Extremal G.T.boris
Length of surreal productGonshor✭1CombinatoricsLukáš Lánský
Unsolvability of word problem for 2-knot complementsGordon✭✭✭0Topologyrybu
Combinatorial covering designsGordon; Mills; Rödl; Schönheim✭0Combinatorics » DesignsPseudonym
General position subsetsGowers✭✭0GeometryDavid Wood
Graham's conjecture on tree reconstructionGraham✭✭0Graph Theory » Basic G.T.mdevos
Divisibility of central binomial coefficientsGraham✭✭1Number Theory » Combinatorial N.T.maxal
Pebbling a cartesian productGraham✭✭✭0Graph Theorymdevos
Termination of the sixth Goodstein SequenceGraham✭0Logicmdevos
MSO alternation hierarchy over picturesGrandjean✭✭0Logic » Finite Model Theorydberwanger
Universal Steiner triple systemsGrannell; Griggs; Knor; Skoviera✭✭0Graph Theory » Coloring » Edge coloringmacajova
inverse of an integer matrixGregory✭✭0Algebralvoyster
Grunbaum's ConjectureGrunbaum✭✭✭0Graph Theory » Topological G.T. » Coloringmdevos
4-regular 4-chromatic graphs of high girthGrunbaum✭✭0Graph Theory » Coloringmdevos
Every 4-connected toroidal graph has a Hamilton cycleGrunbaum; Nash-Williams✭✭0Graph Theory » Topological G.T.fhavet
Laplacian Degrees of a GraphGuo✭✭0Graph Theory » Algebraic G.T.Robert Samal
Graphs with a forbidden induced tree are chi-boundedGyarfas✭✭✭0Graph Theory » Coloring » Vertex coloringmdevos
The circular embedding conjectureHaggard✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
Decomposing an eulerian graph into cycles.Hajós✭✭0Graph Theory » Basic G.T. » Cyclesfhavet
Edge Reconstruction ConjectureHarary✭✭✭0Graph Theorymelch
Large acyclic induced subdigraph in a planar oriented graph.Harutyunyan✭✭0Graph Theory » Directed Graphsfhavet
Fractional HadwigerHarvey; Reed; Seymour; Wood✭✭1Graph TheoryDavid Wood
Chromatic Number of Common GraphsHatami; Hladký; Kráľ; Norine; Razborov✭✭0Graph TheoryDavid Wood
Erdős-Posa property for long directed cyclesHavet; Maia✭✭0Graph Theory » Directed Graphsfhavet
Almost all non-Hamiltonian 3-regular graphs are 1-connectedHaythorpe✭✭1Graph Theory » Basic G.T.mhaythorpe
Hedetniemi's ConjectureHedetniemi✭✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Inverse Galois ProblemHilbert✭✭✭✭0Group Theorytchow
2-colouring a graph without a monochromatic maximum cliqueHoang; McDiarmid✭✭0Graph Theory » Coloring » Vertex coloringJon Noel
Hoàng-Reed ConjectureHoang; Reed✭✭✭0Graph Theory » Directed Graphsfhavet
The Hodge ConjectureHodge✭✭✭✭0Geometry » Algebraic GeometryCharles
57-regular Moore graph?Hoffman; Singleton✭✭✭0Graph Theory » Algebraic G.T.mdevos
Edge-Colouring Geometric Complete GraphsHurtado✭✭1GeometryDavid Wood
Partial List ColoringIradmusa✭✭✭0Graph Theory » Coloring » Vertex coloringIradmusa
Vertex Coloring of graph fractional powersIradmusa✭✭✭1Graph TheoryIradmusa
Long directed cycles in diregular digraphsJackson✭✭✭0Graph Theory » Directed Graphsfhavet
Hamilton cycle in small d-diregular graphsJackson✭✭0Graph Theory » Directed Graphsfhavet
Jaeger's modular orientation conjectureJaeger✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Petersen coloring conjectureJaeger✭✭✭0Graph Theory » Coloring » Edge coloringmdevos
A nowhere-zero point in a linear mappingJaeger✭✭✭0Combinatorics » Matricesmdevos
Mapping planar graphs to odd cyclesJaeger✭✭✭0Graph Theory » Coloring » Homomorphismsmdevos

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

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

Syndicate content