Home

Solved problems

TitleAuthor(s)Imp.¹Rec.²Area » Topic » Subtopicsort iconPosted by
Total Dominator Chromatic Number of a HypercubeAdel P. Kazemi✭✭0Graph Theory » Coloring » Vertex coloringAdel P. Kazemi
Nonrepetitive colourings of planar graphsAlon N.; Grytczuk J.; Hałuszczak M.; Riordan O.✭✭0Graph Theory » Coloring » Vertex coloringDavid Wood
(2 + epsilon)-flow conjectureGoddyn; Seymour✭✭✭0Graph Theory » Coloring » Nowhere-zero flowsmdevos
Good edge labeling and girthBode-Farzad-Theis✭✭0Graph Theory » Coloring » LabelingDOT
Colouring $d$-degenerate graphs with large girthWood✭✭1Graph Theory » ColoringDavid Wood
Petersen graph conjectureMkrtchyan; Petrosyan✭1Graph Theory » Basic G.T. » Matchingsvahanmkrtchyan2002
Exponentially many perfect matchings in cubic graphsLovasz; Plummer✭✭✭0Graph Theory » Basic G.T. » Matchingsmdevos
Bigger cycles in cubic graphs✭✭0Graph Theory » Basic G.T. » Cyclesmdevos
Middle levels problemErdos✭✭0Graph Theory » Basic G.T. » Cyclestchow
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
The sum of the two largest eigenvaluesGernert✭✭0Graph Theory » Algebraic G.T.mdevos
spanning trees✭✭1Graph Theoryakhodkar
Hitting every large maximal clique with a stable setKing; Rabern✭✭1Graph TheoryAndrew King
Hirsch ConjectureHirsch✭✭✭0Geometry » PolytopesRobert Samal
Decomposing the truncated octahedron into parallelepipeds✭1Geometry » Polytopesmdevos
Geometric Hales-Jewett TheoremPor; Wood✭✭0GeometryDavid Wood
Difference between neighbors in a matrixVadim Lioubimov✭1Combinatorics » MatricesVadim Lioubimov
Inequality of complex numbers✭✭1Analysisfeanor
Oakley sunglasses can successfully secure their sight will very likely be common-sense✭✭0Analysishaumiki
On Gersgorin Theorem✭✭0AlgebraMiwa Lin

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