Home

Solved problems

Titlesort iconAuthor(s)Imp.¹Rec.²Area » Topic » SubtopicPosted by
Values of a multifuncoid on atomsPorton✭✭0Topologyporton
Upgrading a multifuncoidPorton✭✭0Topologyporton
Total Dominator Chromatic Number of a HypercubeAdel P. Kazemi✭✭0Graph Theory » Coloring » Vertex coloringAdel P. Kazemi
Total Domination number of a hypercubeAdel P. Kazemi✭✭✭0Graph Theory » Basic G.T.Adel P. Kazemi
The sum of the two largest eigenvaluesGernert✭✭0Graph Theory » Algebraic G.T.mdevos
Straight line representation of planar linear hypergraphsOssona de Mendez; de Fraysseix✭✭0Graph Theory » Topological G.T. » Drawingstaxipom
Steinberg's conjecture✭✭✭✭0Graph Theory » Coloring » Vertex coloringfhavet
Star height problemLawrence Eggan C.✭✭0Theoretical Comp. Sci.porton
Special MKimberling✭✭1Number Theoryvprusso
spanning trees✭✭1Graph Theoryakhodkar
Restricting a reloid to lattice Gamma before converting it into a funcoidPorton✭✭0Topologyporton
Reloid corresponding to funcoid is between outward and inward reloidPorton✭✭0Topologyporton
Pseudodifference of filter objectsPorton✭✭0Unsortedporton
Petersen graph conjectureMkrtchyan; Petrosyan✭1Graph Theory » Basic G.T. » Matchingsvahanmkrtchyan2002
Outward reloid corresponding to a funcoid corresponding to convex reloidPorton✭✭0Topologyporton
Outer reloid of direct product of filtersPorton✭✭0Topologyporton
On Gersgorin Theorem✭✭0AlgebraMiwa Lin
Ohba's ConjectureOhba✭✭1Graph Theory » Coloring » Vertex coloringJon Noel
Oakley sunglasses can successfully secure their sight will very likely be common-sense✭✭0Analysishaumiki
Nonrepetitive colourings of planar graphsAlon N.; Grytczuk J.; Hałuszczak M.; Riordan O.✭✭0Graph Theory » Coloring » Vertex coloringDavid Wood
Monovalued reloid restricted to atomic filterPorton✭✭0Topologyporton
Monovalued reloid is a restricted functionPorton✭✭0Topologyporton
Monochromatic reachability in edge-colored tournamentsErdos✭✭✭0Graph Theory » Directed Graphs » Tournamentsmdevos
Middle levels problemErdos✭✭0Graph Theory » Basic G.T. » Cyclestchow
Matching polynomials of vertex transitive graphsMohar✭✭0Graph Theory » Algebraic G.T.Robert Samal
Join of oblique productsPorton✭✭0Topologyporton
Is every regular paratopological group Tychonoff?unknown✭✭0Topologyporton
Inward reloid corresponding to a funcoid corresponding to convex reloidPorton✭✭0Topologyporton
Intersection of complete funcoidsPorton✭✭0Topologyporton
Inner reloid through the lattice GammaPorton✭✭0Topologyporton
Inequality of complex numbers✭✭1Analysisfeanor
Hitting every large maximal clique with a stable setKing; Rabern✭✭1Graph TheoryAndrew King
Hirsch ConjectureHirsch✭✭✭0Geometry » PolytopesRobert Samal
Hall-Paige conjectureHall; Paige✭✭✭0Group Theorymdevos
Good edge labeling and girthBode-Farzad-Theis✭✭0Graph Theory » Coloring » LabelingDOT
Geometric Hales-Jewett TheoremPor; Wood✭✭0GeometryDavid Wood
Funcoid corresponding to reloid through lattice GammaPorton✭✭0Topologyporton
Funcoid corresponding to inward reloidPorton✭✭0Topologyporton
Fowler's Conjecture on eigenvalues of (3,6)-polyhedraFowler✭✭0Graph Theory » Algebraic G.T.Robert Samal
Exponentially many perfect matchings in cubic graphsLovasz; Plummer✭✭✭0Graph Theory » Basic G.T. » Matchingsmdevos
Every monovalued reloid is metamonovaluedPorton✭✭0Topologyporton
Entourages of a composition of funcoidsPorton✭✭0Topologyporton
Domain and image of inner reloidPorton✭✭0Topologyporton
Domain and image for Gamma-reloidPorton✭✭0Topologyporton
Does every subcubic triangle-free graph have fractional chromatic number at most 14/5?Heckman; Thomas✭0Graph Theory » Coloring » Vertex coloringAndrew King
Do filters complementive to a given filter form a complete lattice?Porton✭✭0Unsortedporton
Distributivity of union of funcoids corresponding to reloidsPorton✭✭0Topologyporton
Distributivity of outward reloid over composition of funcoidsPorton✭✭0Topologyporton
Distributivity of inward reloid over composition of funcoidsPorton✭✭0Topologyporton
Distributivity of composition over union of reloidsPorton✭✭0Topologyporton

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