Home

Solved problems

TitleAuthor(s)Imp.¹sort iconRec.²Area » Topic » SubtopicPosted by
Steinberg's conjecture✭✭✭✭0Graph Theory » Coloring » Vertex coloringfhavet
(2 + epsilon)-flow conjectureGoddyn; Seymour✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Hirsch ConjectureHirsch✭✭✭0Geometry » PolytopesRobert Samal
Alon-Saks-Seymour ConjectureAlon; Saks; Seymour✭✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Bounding the chromatic number of graphs with no odd holeGyarfas✭✭✭0Graph Theory » Coloring » Vertex coloringmdevos
Hall-Paige conjectureHall; Paige✭✭✭0Group Theorymdevos
Exponentially many perfect matchings in cubic graphsLovasz; Plummer✭✭✭0Graph Theory » Basic G.T. » Matchingsmdevos
Monochromatic reachability in edge-colored tournamentsErdos✭✭✭0Graph Theory » Directed Graphs » Tournamentsmdevos
DIS-PROOF OF BEALS CONJECTURE✭✭✭0Number Theory » Additive N.T.lalitha
A construction of direct product in the category of continuous maps between endo-funcoidsPorton✭✭✭0Topologyporton
Total Domination number of a hypercubeAdel P. Kazemi✭✭✭0Graph Theory » Basic G.T.Adel P. Kazemi
Matching polynomials of vertex transitive graphsMohar✭✭0Graph Theory » Algebraic G.T.Robert Samal
Fowler's Conjecture on eigenvalues of (3,6)-polyhedraFowler✭✭0Graph Theory » Algebraic G.T.Robert Samal
Bounded colorings for planar graphsAlon; Ding; Oporowski; Vertigan✭✭1Graph Theory » Topological G.T. » Coloringmdevos
The sum of the two largest eigenvaluesGernert✭✭0Graph Theory » Algebraic G.T.mdevos
Intersection of complete funcoidsPorton✭✭0Topologyporton
Monovalued reloid is a restricted functionPorton✭✭0Topologyporton
Distributivity of composition over union of reloidsPorton✭✭0Topologyporton
Funcoid corresponding to inward reloidPorton✭✭0Topologyporton
Distributivity of outward reloid over composition of funcoidsPorton✭✭0Topologyporton
Outward reloid corresponding to a funcoid corresponding to convex reloidPorton✭✭0Topologyporton
Inward reloid corresponding to a funcoid corresponding to convex reloidPorton✭✭0Topologyporton
Distributivity of union of funcoids corresponding to reloidsPorton✭✭0Topologyporton
Reloid corresponding to funcoid is between outward and inward reloidPorton✭✭0Topologyporton
Bigger cycles in cubic graphs✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
Straight line representation of planar linear hypergraphsOssona de Mendez; de Fraysseix✭✭0Graph Theory » Topological G.T. » Drawingstaxipom
5-coloring graphs with small crossing & clique numbersOporowski; Zhao✭✭1Graph Theory » Topological G.T. » Coloringmdevos
Coloring squares of hypercubesWan✭✭1Graph Theory » Coloring » Vertex coloringmdevos
Is every regular paratopological group Tychonoff?unknown✭✭0Topologyporton
Middle levels problemErdos✭✭0Graph Theory » Basic G.T. » Cyclestchow
On Gersgorin Theorem✭✭0AlgebraMiwa Lin
Composition of atomic reloidsPorton✭✭0Topologyporton
Atomic reloids are monovaluedPorton✭✭0Topologyporton
Monovalued reloid restricted to atomic filterPorton✭✭0Topologyporton
Do filters complementive to a given filter form a complete lattice?Porton✭✭0Unsortedporton
Pseudodifference of filter objectsPorton✭✭0Unsortedporton
Co-separability of filter objectsPorton✭✭0Unsortedporton
Chain-meet-closed setsPorton✭✭0Unsortedporton
Inequality of complex numbers✭✭1Analysisfeanor
spanning trees✭✭1Graph Theoryakhodkar
Outer reloid of direct product of filtersPorton✭✭0Topologyporton
Composition of reloids expressed through atomic reloidsPorton✭✭0Topologyporton
Characterization of monovalued reloids with atomic domainsPorton✭✭0Topologyporton
Domain and image of inner reloidPorton✭✭0Topologyporton
Hitting every large maximal clique with a stable setKing; Rabern✭✭1Graph TheoryAndrew King
Ohba's ConjectureOhba✭✭1Graph Theory » Coloring » Vertex coloringJon Noel
Join of oblique productsPorton✭✭0Topologyporton
Good edge labeling and girthBode-Farzad-Theis✭✭0Graph Theory » Coloring » LabelingDOT
Upgrading a multifuncoidPorton✭✭0Topologyporton
Star height problemLawrence Eggan C.✭✭0Theoretical Comp. Sci.porton

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