Open Problem Garden
Help
About
Contact
login/create account
Home
Solved problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Hall-Paige conjecture
Hall
;
Paige
✭✭✭
0
Group Theory
mdevos
Bounding the chromatic number of graphs with no odd hole
Gyarfas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
(2 + epsilon)-flow conjecture
Goddyn
;
Seymour
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
The sum of the two largest eigenvalues
Gernert
✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Fowler's Conjecture on eigenvalues of (3,6)-polyhedra
Fowler
✭✭
0
Graph Theory
»
Algebraic G.T.
Robert Samal
Monochromatic reachability in edge-colored tournaments
Erdos
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
mdevos
Middle levels problem
Erdos
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
tchow
Good edge labeling and girth
Bode-Farzad-Theis
✭✭
0
Graph Theory
»
Coloring
»
Labeling
DOT
Alon-Saks-Seymour Conjecture
Alon
;
Saks
;
Seymour
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Bounded colorings for planar graphs
Alon
;
Ding
;
Oporowski
;
Vertigan
✭✭
1
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
Nonrepetitive colourings of planar graphs
Alon N.
;
Grytczuk J.
;
Hałuszczak M.
;
Riordan O.
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
David Wood
Total Domination number of a hypercube
Adel P. Kazemi
✭✭✭
0
Graph Theory
»
Basic G.T.
Adel P. Kazemi
Total Dominator Chromatic Number of a Hypercube
Adel P. Kazemi
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Adel P. Kazemi
Decomposing the truncated octahedron into parallelepipeds
✭
1
Geometry
»
Polytopes
mdevos
Bigger cycles in cubic graphs
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
On Gersgorin Theorem
✭✭
0
Algebra
Miwa Lin
Inequality of complex numbers
✭✭
1
Analysis
feanor
spanning trees
✭✭
1
Graph Theory
akhodkar
Oakley sunglasses can successfully secure their sight will very likely be common-sense
✭✭
0
Analysis
haumiki
Steinberg's conjecture
✭✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Choice number of complete multipartite graphs with parts of size 4
✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
DIS-PROOF OF BEALS CONJECTURE
✭✭✭
0
Number Theory
»
Additive N.T.
lalitha
« first
‹ previous
1
2
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Chords of longest cycles
Do any three longest paths in a connected graph have a vertex in common?
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
more