Solved problems

TitleAuthor(s)Imp.¹sort iconRec.²Area » Topic » SubtopicPosted by
Values of a multifuncoid on atomsPorton✭✭0Topologyporton
Every monovalued reloid is metamonovaluedPorton✭✭0Topologyporton
Total Dominator Chromatic Number of a HypercubeAdel P. Kazemi✭✭0Graph Theory » Coloring » Vertex coloringAdel P. Kazemi
Colouring $d$-degenerate graphs with large girthWood✭✭1Graph Theory » ColoringDavid Wood
Nonrepetitive colourings of planar graphsAlon N.; Grytczuk J.; Hałuszczak M.; Riordan O.✭✭0Graph Theory » Coloring » Vertex coloringDavid Wood
Geometric Hales-Jewett TheoremPor; Wood✭✭0GeometryDavid Wood
Inner reloid through the lattice GammaPorton✭✭0Topologyporton
Restricting a reloid to lattice Gamma before converting it into a funcoidPorton✭✭0Topologyporton
Funcoid corresponding to reloid through lattice GammaPorton✭✭0Topologyporton
Domain and image for Gamma-reloidPorton✭✭0Topologyporton
Entourages of a composition of funcoidsPorton✭✭0Topologyporton
(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
Steinberg's conjecture✭✭✭✭0Graph Theory » Coloring » Vertex coloringfhavet