Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
What is the smallest number of disjoint spanning trees made a graph Hamiltonian
Goldengorin
✭✭
0
Graph Theory
»
Extremal G.T.
boris
Goldberg's conjecture
Goldberg
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Goldbach conjecture
Goldbach
✭✭✭✭
0
Number Theory
»
Additive N.T.
Benschop
Complexity of square-root sum
Goemans
✭✭
0
Theoretical Comp. Sci.
»
Complexity
abie
A conjecture on iterated circumcentres
Goddyn
✭✭
1
Geometry
mdevos
Giuga's Conjecture on Primality
Giuseppe Giuga
✭✭
0
Number Theory
princeps
Circular coloring triangle-free subcubic planar graphs
Ghebleh
;
Zhu
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Special Primes
George BALAN
✭
1
Number Theory
maththebalans
Geodesic cycles and Tutte's Theorem
Georgakopoulos
;
Sprüssel
✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
Agelos
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
End-Devouring Rays
Georgakopoulos
✭
1
Graph Theory
»
Infinite Graphs
Agelos
Sum of prime and semiprime conjecture
Geoffrey Marnell
✭✭
0
Number Theory
princeps
Are vertex minor closed classes chi-bounded?
Geelen
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Do any three longest paths in a connected graph have a vertex in common?
Gallai
✭✭
0
Graph Theory
fhavet
Decomposing a connected graph into paths.
Gallai
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Paths
fhavet
Subgroup formed by elements of order dividing n
Frobenius
✭✭
0
Group Theory
dlh12
Frankl's union-closed sets conjecture
Frankl
✭✭
0
Graph Theory
»
Hypergraphs
tchow
Long rainbow arithmetic progressions
Fox
;
Jungic
;
Mahdian
;
Nesetril
;
Radoicic
✭✭
0
Combinatorics
vjungic
Complete bipartite subgraphs of perfect graphs
Fox
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Slice-ribbon problem
Fox
✭✭✭✭
0
Topology
rybu
Algorithm for graph homomorphisms
Fomin
;
Heggernes
;
Kratsch
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
jfoniok
P vs. PSPACE
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
cwenner
P vs. BPP
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Derandomization
Charles R Great...
4-connected graphs are not uniquely hamiltonian
Fleischner
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
Acyclic edge-colouring
Fiamcik
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
3-Colourability of Arrangements of Great Circles
Felsner
;
Hurtado
;
Noy
;
Streinu
✭✭
1
Graph Theory
»
Topological G.T.
»
Coloring
David Wood
Refuting random 3SAT-instances on $O(n)$ clauses (weak form)
Feige
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Hardness of Approximation
cwenner
Sums of independent random variables with unbounded variance
Feige
✭✭
0
Theoretical Comp. Sci.
cwenner
Chromatic number of associahedron
Fabila-Monroy
;
Flores-Penaloza
;
Huemer
;
Hurtado
;
Urrutia
;
Wood
✭✭
1
Geometry
David Wood
A sextic counterexample to Euler's sum of powers conjecture
Euler
✭✭
1
Number Theory
»
Computational N.T.
maxal
Sequence defined on multisets
Erickson
✭✭
1
Combinatorics
Martin Erickson
Square achievement game on an n x n grid
Erickson
✭✭
1
Combinatorics
Martin Erickson
Exact colorings of graphs
Erickson
✭✭
0
Graph Theory
Martin Erickson
Transversal achievement game on a square grid
Erickson
✭✭
1
Combinatorics
Martin Erickson
The Erdos-Turan conjecture on additive bases
Erdos
;
Turan
✭✭✭✭
0
Number Theory
»
Additive N.T.
mdevos
Erdös-Szekeres conjecture
Erdos
;
Szekeres
✭✭✭
0
Geometry
mdevos
Erdős–Straus conjecture
Erdos
;
Straus
✭✭
1
Number Theory
ACW
Turán number of a finite family.
Erdos
;
Simonovits
✭✭
0
Graph Theory
fhavet
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
Strong edge colouring conjecture
Erdos
;
Nesetril
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
fhavet
Double-critical graph conjecture
Erdos
;
Lovasz
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
DFR
The Erdös-Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Extremal G.T.
mdevos
Unions of triangle free graphs
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Extremal G.T.
Jon Noel
The Crossing Number of the Hypercube
Erdos
;
Guy
✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
Robert Samal
Odd-cycle transversal in triangle-free graphs
Erdos
;
Faudree
;
Pach
;
Spencer
✭✭
0
Graph Theory
»
Extremal G.T.
fhavet
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Diagonal Ramsey numbers
Erdos
✭✭✭✭
0
Combinatorics
»
Ramsey Theory
mdevos
« 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