Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Seymour's self-minor conjecture
Seymour
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Reed's omega, delta, and chi conjecture
Reed
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Gao's theorem for nonabelian groups
DeVos
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Triangle free strongly regular graphs
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Half-integral flow polynomial values
Mohar
✭✭
0
Graph Theory
»
Algebraic G.T.
mohar
Unions of triangle free graphs
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Diagonal Ramsey numbers
Erdos
✭✭✭✭
0
Combinatorics
»
Ramsey Theory
mdevos
Rota's unimodal conjecture
Rota
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
The Erdos-Turan conjecture on additive bases
Erdos
;
Turan
✭✭✭✭
0
Number Theory
»
Additive N.T.
mdevos
Bases of many weights
Schrijver
;
Seymour
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
Ramsey properties of Cayley graphs
Alon
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
The large sets conjecture
Brown
;
Graham
;
Landman
✭✭✭
0
Combinatorics
»
Ramsey Theory
vjungic
Aharoni-Berger conjecture
Aharoni
;
Berger
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
Barnette's Conjecture
Barnette
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
Robert Samal
List colorings of edge-critical graphs
Mohar
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
Robert Samal
Circular coloring triangle-free subcubic planar graphs
Ghebleh
;
Zhu
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Concavity of van der Waerden numbers
Landman
✭✭
0
Combinatorics
»
Ramsey Theory
Bruce Landman
Laplacian Degrees of a Graph
Guo
✭✭
0
Graph Theory
»
Algebraic G.T.
Robert Samal
5-local-tensions
DeVos
✭✭
0
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
Mapping planar graphs to odd cycles
Jaeger
✭✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
mdevos
Sets with distinct subset sums
Erdos
✭✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Lonely runner conjecture
Cusick
;
Wills
✭✭✭
0
Number Theory
mdevos
Long rainbow arithmetic progressions
Fox
;
Jungic
;
Mahdian
;
Nesetril
;
Radoicic
✭✭
0
Combinatorics
vjungic
The 3n+1 conjecture
Collatz
✭✭✭
0
Number Theory
»
Combinatorial N.T.
dododododo
Weak pentagon problem
Samal
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
Robert Samal
Graceful Tree Conjecture
✭✭✭
0
Graph Theory
»
Coloring
»
Labeling
kintali
The robustness of the tensor product
Ben-Sasson
;
Sudan
✭✭✭
0
Theoretical Comp. Sci.
»
Coding Theory
ormeir
Unconditional derandomization of Arthur-Merlin games
Shaltiel
;
Umans
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Derandomization
ormeir
Complexity of square-root sum
Goemans
✭✭
0
Theoretical Comp. Sci.
»
Complexity
abie
Rainbow AP(4) in an almost equinumerous coloring
Conlon
✭✭
0
Combinatorics
vjungic
r-regular graphs are not uniquely hamiltonian.
Sheehan
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
Robert Samal
Infinite uniquely hamiltonian graphs
Mohar
✭✭
0
Graph Theory
»
Infinite Graphs
Robert Samal
Hamiltonian cycles in line graphs
Thomassen
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
Robert Samal
Hamiltonian cycles in line graphs of infinite graphs
Georgakopoulos
✭✭
0
Graph Theory
»
Infinite Graphs
Robert Samal
Hamiltonian cycles in powers of infinite graphs
Georgakopoulos
✭✭
0
Graph Theory
»
Infinite Graphs
Robert Samal
Odd incongruent covering systems
Erdos
;
Selfridge
✭✭✭
0
Number Theory
»
Combinatorial N.T.
Robert Samal
Covering systems with big moduli
Erdos
;
Selfridge
✭✭
0
Number Theory
»
Combinatorial N.T.
Robert Samal
Oriented chromatic number of planar graphs
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Robert Samal
The intersection of two perfect matchings
Macajova
;
Skoviera
✭✭
0
Graph Theory
»
Basic G.T.
»
Matchings
mdevos
¿Are critical k-forests tight?
Strausz
✭✭
0
Graph Theory
»
Hypergraphs
Dino
Three-chromatic (0,2)-graphs
Payan
✭✭
0
Graph Theory
»
Coloring
Gordon Royle
Davenport's constant
✭✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
What is the smallest number of disjoint spanning trees made a graph Hamiltonian
Goldengorin
✭✭
0
Graph Theory
»
Extremal G.T.
boris
The Riemann Hypothesis
Riemann
✭✭✭✭
0
Number Theory
»
Analytic N.T.
eric
Rendezvous on a line
Alpern
✭✭✭
0
Unsorted
mdevos
Pebbling a cartesian product
Graham
✭✭✭
0
Graph Theory
mdevos
Linear Hypergraphs with Dimension 3
Ossona de Mendez
;
Rosenstiehl
;
de Fraysseix
✭✭
0
Graph Theory
»
Topological G.T.
»
Drawings
taxipom
Average diameter of a bounded cell of a simple arrangement
Deza
;
Terlaky
;
Zinchenko
✭✭
0
Geometry
deza
Continous analogue of Hirsch conjecture
Deza
;
Terlaky
;
Zinchenko
✭✭
0
Geometry
»
Polytopes
deza
The Bermond-Thomassen Conjecture
Bermond
;
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
JS
« first
‹ previous
1
2
3
4
5
6
7
8
9
next ›
last »
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