Open Problems


Titlesort iconAuthor(s)Imp.¹Rec.²Area » Topic » SubtopicPosted by
Choosability of Graph PowersNoel✭✭1Graph Theory » Coloring » Vertex coloringJon Noel
Choice Number of k-Chromatic Graphs of Bounded OrderNoel✭✭1Graph Theory » Coloring » Vertex coloringJon Noel
Characterizing (aleph_0,aleph_1)-graphsDiestel; Leader✭✭✭0Graph Theory » Infinite Graphsmdevos
Caccetta-Häggkvist ConjectureCaccetta; Häggkvist✭✭✭✭0Graph Theory » Directed Graphsfhavet
Burnside problemBurnside✭✭✭✭0Group Theorydlh12
Bounding the on-line choice number in terms of the choice numberZhu✭✭1Graph Theory » Coloring » Vertex coloringJon Noel
Bounding the chromatic number of triangle-free graphs with fixed maximum degreeKostochka; Reed✭✭0Graph Theory » Coloring » Vertex coloringAndrew King
Bouchet's 6-flow conjectureBouchet✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Book Thickness of SubdivisionsBlankenship; Oporowski✭✭1Graph TheoryDavid Wood
Blatter-Specker Theorem for ternary relationsMakowsky✭✭0Logic » Finite Model Theorydberwanger
Birch & Swinnerton-Dyer conjecture✭✭✭✭0Number Theoryeyoong
Big Line or Big Clique in Planar Point SetsKara; Por; Wood✭✭1GeometryDavid Wood
Beneš Conjecture (graph-theoretic form)Beneš✭✭✭0Graph TheoryVadim Lioubimov
Beneš ConjectureBeneš✭✭✭0CombinatoricsVadim Lioubimov
Bases of many weightsSchrijver; Seymour✭✭✭0Combinatorics » Matroid Theorymdevos
Barnette's ConjectureBarnette✭✭✭0Graph Theory » Basic G.T. » CyclesRobert Samal
Average diameter of a bounded cell of a simple arrangementDeza; Terlaky; Zinchenko✭✭0Geometrydeza
Atomicity of the poset of multifuncoidsPorton✭✭0Topologyporton
Atomicity of the poset of completary multifuncoidsPorton✭✭0Topologyporton
Asymptotic Distribution of Form of Polyhedra Rüdinger✭✭0Graph Theory » Basic G.T.andreasruedinger
Are vertex minor closed classes chi-bounded?Geelen✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Are there only finite Fermat Primes?✭✭✭0Number Theory » Analytic N.T.kurtulmehtap
Are there infinite number of Mersenne Primes?✭✭✭✭0Number Theory » Analytic N.T.kurtulmehtap
Are there an infinite number of lucky primes?Lazarus: Gardiner: Metropolis; Ulam1Number Theory » Additive N.T.cubola zaruka
Are different notions of the crossing number the same?Pach; Tóth✭✭✭0Graph Theory » Topological G.T. » Crossing numberscibulka
Are almost all graphs determined by their spectrum?✭✭✭0Graph Theorymdevos
Are all Mersenne Numbers with prime exponent square-free?✭✭✭0Number Theory » Analytic N.T.kurtulmehtap
Are all Fermat Numbers square-free?✭✭✭0Number Theory » Analytic N.T.kurtulmehtap
Arc-disjoint strongly connected spanning subdigraphsBang-Jensen; Yeo✭✭0Graph Theoryfhavet
Arc-disjoint out-branching and in-branchingThomassen✭✭0Graph Theory » Directed Graphsfhavet
Arc-disjoint directed cycles in regular directed graphsAlon; McDiarmid; Molloy✭✭0Graph Theory » Directed Graphsfhavet
Approximation Ratio for Maximum Edge Disjoint Paths problemBentz✭✭0Graph Theoryjcmeyer
Approximation ratio for k-outerplanar graphsBentz✭✭0Graph Theoryjcmeyer
Antidirected trees in digraphsAddario-Berry; Havet; Linhares Sales; Reed; Thomassé✭✭0Graph Theory » Directed Graphsfhavet
Antichains in the cycle continuous orderDeVos✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Another conjecture about reloids and funcoidsPorton✭✭0Topologyporton
Almost all non-Hamiltonian 3-regular graphs are 1-connectedHaythorpe✭✭1Graph Theory » Basic G.T.mhaythorpe
Algorithm for graph homomorphismsFomin; Heggernes; Kratsch✭✭0Graph Theory » Coloring » Homomorphismsjfoniok
Algebraic independence of pi and e✭✭✭0Number Theoryporton
Alexa's Conjecture on PrimalityAlexa✭✭0Number Theoryprinceps
Aharoni-Berger conjectureAharoni; Berger✭✭✭0Combinatorics » Matroid Theorymdevos
Ádám's ConjectureÁdám✭✭✭0Graph Theory » Directed Graphsfhavet
Acyclic list colouring of planar graphs.Borodin; Fon-Der-Flasss; Kostochka; Raspaud; Sopena✭✭✭0Graph Theory » Coloring » Vertex coloringfhavet
Acyclic edge-colouringFiamcik✭✭0Graph Theory » Coloring » Edge coloringmdevos
A sextic counterexample to Euler's sum of powers conjectureEuler✭✭1Number Theory » Computational N.T.maxal
A nowhere-zero point in a linear mappingJaeger✭✭✭0Combinatorics » Matricesmdevos
A homomorphism problem for flowsDeVos✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
A gold-grabbing gameRosenfeld✭✭0Graph Theory » Graph Algorithmsmdevos
A generalization of Vizing's Theorem?Rosenfeld✭✭0Graph Theory » Coloring » Edge coloringmdevos
A funcoid related to directed topological spacesPorton✭✭0Topologyporton
Syndicate content