Open Problems


TitleAuthor(s)sort iconImp.¹Rec.²Area » Topic » SubtopicPosted by
Schanuel's ConjectureSchanuel✭✭✭✭0Number Theory » Analytic N.T.Charles
Monochromatic reachability or rainbow trianglesSands; Sauer; Woodrow✭✭✭0Graph Theory » Directed Graphs » Tournamentsmdevos
Monochromatic reachability in arc-colored digraphsSands; Sauer; Woodrow✭✭✭0Graph Theory » Directed Graphsfhavet
Cores of Cayley graphsSamal✭✭✭✭✭0Graph Theory » Coloring » HomomorphismsRobert Samal
Weak pentagon problemSamal✭✭0Graph Theory » Coloring » HomomorphismsRobert Samal
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.Sabidussi✭✭0Graph Theory » Basic G.T. » Cyclesfhavet
Ryser's conjectureRyser✭✭✭0Graph Theory » Hypergraphsmdevos
Matchings extend to Hamiltonian cycles in hypercubesRuskey; Savage✭✭1Graph Theory » Basic G.T. » MatchingsJirka
Criterion for boundedness of power seriesRüdinger1Analysisandreasruedinger
Asymptotic Distribution of Form of Polyhedra Rüdinger✭✭0Graph Theory » Basic G.T.andreasruedinger
Rota's unimodal conjectureRota✭✭✭0Combinatorics » Matroid Theorymdevos
Rota's basis conjectureRota✭✭✭0Combinatorics » Matricesmdevos
A generalization of Vizing's Theorem?Rosenfeld✭✭0Graph Theory » Coloring » Edge coloringmdevos
Coloring the Odd Distance GraphRosenfeld✭✭✭0Graph Theory » Coloring » Vertex coloringmdevos
A gold-grabbing gameRosenfeld✭✭0Graph Theory » Graph Algorithmsmdevos
Earth-Moon ProblemRingel✭✭1Graph Theory » Coloring » Vertex coloringfhavet
The Riemann HypothesisRiemann✭✭✭✭0Number Theory » Analytic N.T.eric
Inequality for square summable complex series Retkes✭✭1Analysistigris35711
Linear-size circuits for stable $0,1 < 2$ sorting?Regan✭✭1Theoretical Comp. Sci. » ComplexityKWRegan
Forcing a 2-regular minorReed; Wood✭✭1Graph Theory » Basic G.T. » MinorsDavid Wood
Reed's omega, delta, and chi conjectureReed✭✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Domination in cubic graphsReed✭✭0Graph Theory » Basic G.T.mdevos
Hamiltonicity of Cayley graphsRapaport-Strasser✭✭✭1Graph Theory » Basic G.T. » Cyclestchow
S(S(f)) = S(f) for reloidsPorton✭✭0Topologyporton
Outer reloid of restricted funcoidPorton✭✭0Topologyporton
Strict inequalities for products of filtersPorton0Topologyporton
Funcoidal products inside an inward reloidPorton✭✭0Topologyporton
Upgrading a completary multifuncoidPorton✭✭0Topologyporton
Atomicity of the poset of completary multifuncoidsPorton✭✭0Topologyporton
Atomicity of the poset of multifuncoidsPorton✭✭0Topologyporton
Graph product of multifuncoidsPorton✭✭0Topologyporton
A conjecture about direct product of funcoidsPorton✭✭0Topologyporton
Decomposition of completions of reloidsPorton✭✭0Topologyporton
Every metamonovalued funcoid is monovaluedPorton✭✭0Topologyporton
Every metamonovalued reloid is monovaluedPorton✭✭0Topologyporton
Generalized path-connectedness in proximity spacesPorton✭✭0Topologyporton
Direct proof of a theorem about compact funcoidsPorton✭✭0Topologyporton
Another conjecture about reloids and funcoidsPorton✭✭0Topologyporton
What are hyperfuncoids isomorphic to?Porton✭✭0Topologyporton
Infinite distributivity of meet over join for a principal funcoidPorton✭✭0Topologyporton
A funcoid related to directed topological spacesPorton✭✭0Topologyporton
Outward reloid of composition vs composition of outward reloidsPorton✭✭0Topologyporton
A diagram about funcoids and reloidsPorton✭✭0Topologyporton
Which outer reloids are equal to inner onesPorton✭✭0Topologyporton
Smooth 4-dimensional Poincare conjecturePoincare; Smale; Stallings✭✭✭✭0Topologyrybu
Negative association in uniform forestsPemantle✭✭0Graph Theory » Probabilistic G.T.mdevos
Three-chromatic (0,2)-graphsPayan✭✭0Graph Theory » ColoringGordon Royle
$C^r$ Stability ConjecturePalis; Smale✭✭✭✭0Analysism n
Are different notions of the crossing number the same?Pach; Tóth✭✭✭0Graph Theory » Topological G.T. » Crossing numberscibulka
Equality in a matroidal circumference boundOxley; Royle✭✭0Combinatorics » Matroid TheoryGordon Royle
Syndicate content