Open Problems


TitleAuthor(s)Imp.¹Rec.²Area » Topic » SubtopicPosted bysort icon
A diagram about funcoids and reloidsPorton✭✭0Topologyporton
Which outer reloids are equal to inner onesPorton✭✭0Topologyporton
The robustness of the tensor productBen-Sasson; Sudan✭✭✭0Theoretical Comp. Sci. » Coding Theoryormeir
Unconditional derandomization of Arthur-Merlin gamesShaltiel; Umans✭✭✭0Theoretical Comp. Sci. » Complexity » Derandomizationormeir
Seymour's Second Neighbourhood ConjectureSeymour✭✭✭1Graph Theory » Directed Graphsnkorppi
Convex 'Fair' Partitions Of Convex PolygonsNandakumar; Ramana✭✭1GeometryNandakumar
Convex Equipartitions with Extreme PerimeterNandakumar✭✭1GeometryNandakumar
Half-integral flow polynomial valuesMohar✭✭0Graph Theory » Algebraic G.T.mohar
trace inequality✭✭0AlgebraMiwa Lin
Almost all non-Hamiltonian 3-regular graphs are 1-connectedHaythorpe✭✭1Graph Theory » Basic G.T.mhaythorpe
Edge Reconstruction ConjectureHarary✭✭✭0Graph Theorymelch
5-flow conjectureTutte✭✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
4-flow conjectureTutte✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
3-flow conjectureTutte✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Jaeger's modular orientation conjectureJaeger✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Bouchet's 6-flow conjectureBouchet✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
The three 4-flows conjectureDeVos✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
A homomorphism problem for flowsDeVos✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Real roots of the flow polynomialWelsh✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Unit vector flowsJain✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Cycle double cover conjectureSeymour; Szekeres✭✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
The circular embedding conjectureHaggard✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
(m,n)-cycle coversCelmins; Preissmann✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
Faithful cycle coversSeymour✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
Decomposing eulerian graphs✭✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
The Berge-Fulkerson conjectureBerge; Fulkerson✭✭✭✭0Graph Theory » Basic G.T. » Matchingsmdevos
Petersen coloring conjectureJaeger✭✭✭0Graph Theory » Coloring » Edge coloringmdevos
Packing T-joinsDeVos✭✭0Graph Theory » Coloring » Edge coloringmdevos
Acyclic edge-colouringFiamcik✭✭0Graph Theory » Coloring » Edge coloringmdevos
Partitioning edge-connectivityDeVos✭✭0Graph Theory » Basic G.T. » Connectivitymdevos
A nowhere-zero point in a linear mappingJaeger✭✭✭0Combinatorics » Matricesmdevos
The additive basis conjectureJaeger; Linial; Payan; Tarsi✭✭✭0Combinatorics » Matricesmdevos
The permanent conjectureKahn✭✭0Combinatorics » Matricesmdevos
The Alon-Tarsi basis conjectureAlon; Linial; Meshulam✭✭0Combinatorics » Matricesmdevos
Highly connected graphs with no K_n minorThomas✭✭✭0Graph Theory » Basic G.T. » Minorsmdevos
Jorgensen's ConjectureJorgensen✭✭✭0Graph Theory » Basic G.T. » Minorsmdevos
Olson's ConjectureOlson✭✭0Number Theory » Combinatorial N.T.mdevos
Few subsequence sums in Z_n x Z_nBollobas; Leader✭✭0Number Theory » Combinatorial N.T.mdevos
What is the largest graph of positive curvature?DeVos; Mohar1Graph Theory » Topological G.T. » Planar graphsmdevos
The stubborn list partition problemCameron; Eschen; Hoang; Sritharan✭✭0Graph Theory » Graph Algorithmsmdevos
57-regular Moore graph?Hoffman; Singleton✭✭✭0Graph Theory » Algebraic G.T.mdevos
Hamiltonian paths and cycles in vertex transitive graphsLovasz✭✭✭0Graph Theory » Algebraic G.T.mdevos
The Erdös-Hajnal ConjectureErdos; Hajnal✭✭✭0Graph Theory » Extremal G.T.mdevos
Subset-sums equality (pigeonhole version)✭✭✭0Theoretical Comp. Sci. » Complexitymdevos
Graham's conjecture on tree reconstructionGraham✭✭0Graph Theory » Basic G.T.mdevos
Ryser's conjectureRyser✭✭✭0Graph Theory » Hypergraphsmdevos
The Two Color ConjectureNeumann-Lara✭✭0Graph Theory » Directed Graphsmdevos
Grunbaum's ConjectureGrunbaum✭✭✭0Graph Theory » Topological G.T. » Coloringmdevos
Woodall's ConjectureWoodall✭✭✭0Graph Theory » Directed Graphsmdevos
A generalization of Vizing's Theorem?Rosenfeld✭✭0Graph Theory » Coloring » Edge coloringmdevos
Syndicate content