Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Jacobian Conjecture
Keller
✭✭✭
0
Geometry
»
Algebraic Geometry
Charles
List Hadwiger Conjecture
Kawarabayashi
;
Mohar
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
David Wood
Big Line or Big Clique in Planar Point Sets
Kara
;
Por
;
Wood
✭✭
1
Geometry
David Wood
Cube-Simplex conjecture
Kalai
✭✭✭
0
Geometry
»
Polytopes
mdevos
The Double Cap Conjecture
Kalai
✭✭
0
Combinatorics
Jon Noel
Every prism over a 3-connected planar graph is hamiltonian.
Kaiser
;
Král
;
Rosenfeld
;
Ryjácek
;
Voss
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
The permanent conjecture
Kahn
✭✭
0
Combinatorics
»
Matrices
mdevos
Jorgensen's Conjecture
Jorgensen
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
mdevos
Rank vs. Genus
Johnson
✭✭✭
0
Topology
Jesse Johnson
Unit vector flows
Jain
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
The additive basis conjecture
Jaeger
;
Linial
;
Payan
;
Tarsi
✭✭✭
0
Combinatorics
»
Matrices
mdevos
Jaeger's modular orientation conjecture
Jaeger
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Petersen coloring conjecture
Jaeger
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
A nowhere-zero point in a linear mapping
Jaeger
✭✭✭
0
Combinatorics
»
Matrices
mdevos
Mapping planar graphs to odd cycles
Jaeger
✭✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
mdevos
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Hamilton cycle in small d-diregular graphs
Jackson
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Partial List Coloring
Iradmusa
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Vertex Coloring of graph fractional powers
Iradmusa
✭✭✭
1
Graph Theory
Iradmusa
Edge-Colouring Geometric Complete Graphs
Hurtado
✭✭
1
Geometry
David Wood
57-regular Moore graph?
Hoffman
;
Singleton
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
The Hodge Conjecture
Hodge
✭✭✭✭
0
Geometry
»
Algebraic Geometry
Charles
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
2-colouring a graph without a monochromatic maximum clique
Hoang
;
McDiarmid
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Inverse Galois Problem
Hilbert
✭✭✭✭
0
Group Theory
tchow
Hedetniemi's Conjecture
Hedetniemi
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Almost all non-Hamiltonian 3-regular graphs are 1-connected
Haythorpe
✭✭
1
Graph Theory
»
Basic G.T.
mhaythorpe
Erdős-Posa property for long directed cycles
Havet
;
Maia
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Chromatic Number of Common Graphs
Hatami
;
Hladký
;
Kráľ
;
Norine
;
Razborov
✭✭
0
Graph Theory
David Wood
Fractional Hadwiger
Harvey
;
Reed
;
Seymour
;
Wood
✭✭
1
Graph Theory
David Wood
Large acyclic induced subdigraph in a planar oriented graph.
Harutyunyan
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Edge Reconstruction Conjecture
Harary
✭✭✭
0
Graph Theory
melch
Decomposing an eulerian graph into cycles.
Hajós
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
The circular embedding conjecture
Haggard
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Graphs with a forbidden induced tree are chi-bounded
Gyarfas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Laplacian Degrees of a Graph
Guo
✭✭
0
Graph Theory
»
Algebraic G.T.
Robert Samal
Every 4-connected toroidal graph has a Hamilton cycle
Grunbaum
;
Nash-Williams
✭✭
0
Graph Theory
»
Topological G.T.
fhavet
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
inverse of an integer matrix
Gregory
✭✭
0
Algebra
lvoyster
Universal Steiner triple systems
Grannell
;
Griggs
;
Knor
;
Skoviera
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
macajova
MSO alternation hierarchy over pictures
Grandjean
✭✭
0
Logic
»
Finite Model Theory
dberwanger
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
General position subsets
Gowers
✭✭
0
Geometry
David Wood
Combinatorial covering designs
Gordon
;
Mills
;
Rödl
;
Schönheim
✭
0
Combinatorics
»
Designs
Pseudonym
Unsolvability of word problem for 2-knot complements
Gordon
✭✭✭
0
Topology
rybu
Length of surreal product
Gonshor
✭
1
Combinatorics
Lukáš Lánský
« 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