Home

Open Problems


TitleAuthor(s)Imp.¹Rec.²Area » Topic » SubtopicPosted bysort icon
Cores of Cayley graphsSamal✭✭0Graph Theory » Coloring » HomomorphismsRobert Samal
Pentagon problemNesetril✭✭✭0Graph Theory » Coloring » HomomorphismsRobert Samal
The Crossing Number of the Complete Graph✭✭✭0Graph Theory » Topological G.T. » Crossing numbersRobert Samal
The Crossing Number of the Complete Bipartite GraphTuran✭✭✭0Graph Theory » Topological G.T. » Crossing numbersRobert Samal
The Crossing Number of the HypercubeErdos; Guy✭✭0Graph Theory » Topological G.T. » Crossing numbersRobert Samal
Barnette's ConjectureBarnette✭✭✭0Graph Theory » Basic G.T. » CyclesRobert Samal
List colorings of edge-critical graphsMohar✭✭0Graph Theory » Coloring » Edge coloringRobert Samal
Laplacian Degrees of a GraphGuo✭✭0Graph Theory » Algebraic G.T.Robert Samal
Weak pentagon problemSamal✭✭0Graph Theory » Coloring » HomomorphismsRobert Samal
r-regular graphs are not uniquely hamiltonian.Sheehan✭✭✭0Graph Theory » Basic G.T. » CyclesRobert Samal
Infinite uniquely hamiltonian graphsMohar✭✭0Graph Theory » Infinite GraphsRobert Samal
Hamiltonian cycles in line graphsThomassen✭✭✭0Graph Theory » Basic G.T. » CyclesRobert Samal
Hamiltonian cycles in line graphs of infinite graphsGeorgakopoulos✭✭0Graph Theory » Infinite GraphsRobert Samal
Hamiltonian cycles in powers of infinite graphsGeorgakopoulos✭✭0Graph Theory » Infinite GraphsRobert Samal
Odd incongruent covering systemsErdos; Selfridge✭✭✭0Number Theory » Combinatorial N.T.Robert Samal
Covering systems with big moduliErdos; Selfridge✭✭0Number Theory » Combinatorial N.T.Robert Samal
Oriented chromatic number of planar graphs✭✭0Graph Theory » Coloring » Vertex coloringRobert Samal
Crossing sequencesArchdeacon; Bonnington; Siran✭✭0Graph Theory » Topological G.T. » Crossing numbersRobert Samal
Star chromatic index of cubic graphsDvorak; Mohar; Samal✭✭0Graph TheoryRobert Samal
Star chromatic index of complete graphsDvorak; Mohar; Samal✭✭1Graph TheoryRobert Samal
Combinatorial covering designsGordon; Mills; Rödl; Schönheim✭0Combinatorics » DesignsPseudonym
3 is a primitive root modulo primes of the form 16 q^4 + 1, where q>3 is prime✭✭0Number Theoryprinceps
Sum of prime and semiprime conjectureGeoffrey Marnell✭✭0Number Theoryprinceps
Giuga's Conjecture on PrimalityGiuseppe Giuga✭✭0Number Theoryprinceps
Alexa's Conjecture on PrimalityAlexa✭✭0Number Theoryprinceps
S(S(f)) = S(f) for reloidsPorton✭✭0Topologyporton
Algebraic independence of pi and e✭✭✭0Number Theoryporton
Lindelöf hypothesisLindelöf✭✭0Number Theory » Analytic N.T.porton
Outer reloid of restricted funcoidPorton✭✭0Topologyporton
Sticky Cantor sets✭✭0Topologyporton
Nonseparating planar continuum✭✭0Topologyporton
Hilbert-Smith conjectureDavid Hilbert; Paul A. Smith✭✭0Topologyporton
Strict inequalities for products of filtersPorton✭0Topologyporton
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
Sub-atomic product of funcoids is a categorical product✭✭0Algebraporton
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
One-way functions exist✭✭✭✭0Theoretical Comp. Sci. » Complexityporton
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

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

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

Syndicate content