Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
P vs. BPP
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Derandomization
Charles R Great...
Algorithm for graph homomorphisms
Fomin
;
Heggernes
;
Kratsch
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
jfoniok
Slice-ribbon problem
Fox
✭✭✭✭
0
Topology
rybu
Complete bipartite subgraphs of perfect graphs
Fox
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Long rainbow arithmetic progressions
Fox
;
Jungic
;
Mahdian
;
Nesetril
;
Radoicic
✭✭
0
Combinatorics
vjungic
Frankl's union-closed sets conjecture
Frankl
✭✭
0
Graph Theory
»
Hypergraphs
tchow
Subgroup formed by elements of order dividing n
Frobenius
✭✭
0
Group Theory
dlh12
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
Are vertex minor closed classes chi-bounded?
Geelen
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Sum of prime and semiprime conjecture
Geoffrey Marnell
✭✭
0
Number Theory
princeps
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
Geodesic cycles and Tutte's Theorem
Georgakopoulos
;
Sprüssel
✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
Agelos
Special Primes
George BALAN
✭
1
Number Theory
maththebalans
Circular coloring triangle-free subcubic planar graphs
Ghebleh
;
Zhu
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Giuga's Conjecture on Primality
Giuseppe Giuga
✭✭
0
Number Theory
princeps
A conjecture on iterated circumcentres
Goddyn
✭✭
1
Geometry
mdevos
Complexity of square-root sum
Goemans
✭✭
0
Theoretical Comp. Sci.
»
Complexity
abie
Goldbach conjecture
Goldbach
✭✭✭✭
0
Number Theory
»
Additive N.T.
Benschop
Goldberg's conjecture
Goldberg
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
What is the smallest number of disjoint spanning trees made a graph Hamiltonian
Goldengorin
✭✭
0
Graph Theory
»
Extremal G.T.
boris
Length of surreal product
Gonshor
✭
1
Combinatorics
Lukáš Lánský
Unsolvability of word problem for 2-knot complements
Gordon
✭✭✭
0
Topology
rybu
Combinatorial covering designs
Gordon
;
Mills
;
Rödl
;
Schönheim
✭
0
Combinatorics
»
Designs
Pseudonym
General position subsets
Gowers
✭✭
0
Geometry
David Wood
Graham's conjecture on tree reconstruction
Graham
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Divisibility of central binomial coefficients
Graham
✭✭
1
Number Theory
»
Combinatorial N.T.
maxal
Pebbling a cartesian product
Graham
✭✭✭
0
Graph Theory
mdevos
Termination of the sixth Goodstein Sequence
Graham
✭
0
Logic
mdevos
MSO alternation hierarchy over pictures
Grandjean
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Universal Steiner triple systems
Grannell
;
Griggs
;
Knor
;
Skoviera
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
macajova
inverse of an integer matrix
Gregory
✭✭
0
Algebra
lvoyster
Grunbaum's Conjecture
Grunbaum
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
4-regular 4-chromatic graphs of high girth
Grunbaum
✭✭
0
Graph Theory
»
Coloring
mdevos
Every 4-connected toroidal graph has a Hamilton cycle
Grunbaum
;
Nash-Williams
✭✭
0
Graph Theory
»
Topological G.T.
fhavet
Laplacian Degrees of a Graph
Guo
✭✭
0
Graph Theory
»
Algebraic G.T.
Robert Samal
Graphs with a forbidden induced tree are chi-bounded
Gyarfas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
The circular embedding conjecture
Haggard
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Decomposing an eulerian graph into cycles.
Hajós
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
Edge Reconstruction Conjecture
Harary
✭✭✭
0
Graph Theory
melch
Large acyclic induced subdigraph in a planar oriented graph.
Harutyunyan
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Fractional Hadwiger
Harvey
;
Reed
;
Seymour
;
Wood
✭✭
1
Graph Theory
David Wood
Chromatic Number of Common Graphs
Hatami
;
Hladký
;
Kráľ
;
Norine
;
Razborov
✭✭
0
Graph Theory
David Wood
Erdős-Posa property for long directed cycles
Havet
;
Maia
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Almost all non-Hamiltonian 3-regular graphs are 1-connected
Haythorpe
✭✭
1
Graph Theory
»
Basic G.T.
mhaythorpe
Hedetniemi's Conjecture
Hedetniemi
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Inverse Galois Problem
Hilbert
✭✭✭✭
0
Group Theory
tchow
2-colouring a graph without a monochromatic maximum clique
Hoang
;
McDiarmid
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
« 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