Open Problems


TitleAuthor(s)Imp.¹Rec.²sort iconArea » Topic » SubtopicPosted by
Oriented chromatic number of planar graphs✭✭0Graph Theory » Coloring » Vertex coloringRobert Samal
The intersection of two perfect matchingsMacajova; Skoviera✭✭0Graph Theory » Basic G.T. » Matchingsmdevos
¿Are critical k-forests tight?Strausz✭✭0Graph Theory » HypergraphsDino
Three-chromatic (0,2)-graphsPayan✭✭0Graph Theory » ColoringGordon Royle
Davenport's constant✭✭✭0Number Theory » Combinatorial N.T.mdevos
What is the smallest number of disjoint spanning trees made a graph HamiltonianGoldengorin✭✭0Graph Theory » Extremal G.T.boris
The Riemann HypothesisRiemann✭✭✭✭0Number Theory » Analytic N.T.eric
Rendezvous on a lineAlpern✭✭✭0Unsortedmdevos
Pebbling a cartesian productGraham✭✭✭0Graph Theorymdevos
Linear Hypergraphs with Dimension 3Ossona de Mendez; Rosenstiehl; de Fraysseix✭✭0Graph Theory » Topological G.T. » Drawingstaxipom
Average diameter of a bounded cell of a simple arrangementDeza; Terlaky; Zinchenko✭✭0Geometrydeza
Continous analogue of Hirsch conjectureDeza; Terlaky; Zinchenko✭✭0Geometry » Polytopesdeza
The Bermond-Thomassen ConjectureBermond; Thomassen✭✭0Graph Theory » Directed GraphsJS
Coloring the Odd Distance GraphRosenfeld✭✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Monotone 4-term Arithmetic ProgressionsDavis; Entringer; Graham; Simmons✭✭0Combinatoricsvjungic
Universal Steiner triple systemsGrannell; Griggs; Knor; Skoviera✭✭0Graph Theory » Coloring » Edge coloringmacajova
Even vs. odd latin squaresAlon; Tarsi✭✭✭0Combinatoricsmdevos
Jones' conjectureKloks; Lee; Liu✭✭0Graph Theory » Basic G.T. » Cyclescmlee
Reconstruction conjectureKelly; Ulam✭✭✭✭0Graph Theoryzitterbewegung
F_d versus F_{d+1}Krajicek✭✭✭0Logiczitterbewegung
P vs. NPCook; Levin✭✭✭✭0Theoretical Comp. Sci. » Algorithmszitterbewegung
Universal highly arc transitive digraphsCameron; Praeger; Wormald✭✭✭0Graph Theory » Infinite Graphsmdevos
Unfriendly partitionsCowan; Emerson✭✭✭0Graph Theory » Infinite Graphsmdevos
Strong matchings and coversAharoni✭✭✭0Graph Theory » Infinite Graphsmdevos
Highly arc transitive two ended digraphsCameron; Praeger; Wormald✭✭0Graph Theory » Infinite Graphsmdevos
Equality in a matroidal circumference boundOxley; Royle✭✭0Combinatorics » Matroid TheoryGordon Royle
Ding's tau_r vs. tau conjectureDing✭✭✭0Combinatorics » Optimizationmdevos
Chords of longest cyclesThomassen✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
Growth of finitely presented groupsAdyan✭✭✭0Group Theorymdevos
Goldbach conjectureGoldbach✭✭✭✭0Number Theory » Additive N.T.Benschop
$C^r$ Stability ConjecturePalis; Smale✭✭✭✭0Analysism n
Seagull problemSeymour✭✭✭0Graph Theory » Basic G.T. » Minorsmdevos
Subgroup formed by elements of order dividing nFrobenius✭✭0Group Theorydlh12
Chowla's cosine problemChowla✭✭✭0Number Theorymdevos
Random stable roommatesMertens✭✭0Graph Theory » Basic G.T. » Matchingsmdevos
S(S(f)) = S(f) for reloidsPorton✭✭0Topologyporton
Inscribed Square ProblemToeplitz✭✭0Topologydlh12
Burnside problemBurnside✭✭✭✭0Group Theorydlh12
Combinatorial covering designsGordon; Mills; Rödl; Schönheim0Combinatorics » DesignsPseudonym
Partial List ColoringAlbertson; Grossman; Haas✭✭✭0Graph Theory » Coloring » Vertex coloringIradmusa
Cube-Simplex conjectureKalai✭✭✭0Geometry » Polytopesmdevos
Partial List ColoringIradmusa✭✭✭0Graph Theory » Coloring » Vertex coloringIradmusa
Quartic rationally derived polynomialsBuchholz; MacDougall✭✭✭0Number Theorymdevos
Degenerate colorings of planar graphsBorodin✭✭✭0Graph Theory » Topological G.T. » Coloringmdevos
Nearly spanning regular subgraphsAlon; Mubayi✭✭✭0Graph Theory » Basic G.T.mdevos
Edge Reconstruction ConjectureHarary✭✭✭0Graph Theorymelch
Hedetniemi's ConjectureHedetniemi✭✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Total Colouring ConjectureBehzad✭✭✭0Graph Theory » ColoringIradmusa
Wall-Sun-Sun primes and Fibonacci divisibility✭✭0Number Theory » Computational N.T.adudzik
Cores of strongly regular graphsCameron; Kazanidis✭✭✭0Graph Theory » Algebraic G.T.mdevos
Syndicate content