Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Hoàng-Reed Conjecture
Hoang
;
Reed
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
The Hodge Conjecture
Hodge
✭✭✭✭
0
Geometry
»
Algebraic Geometry
Charles
57-regular Moore graph?
Hoffman
;
Singleton
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Edge-Colouring Geometric Complete Graphs
Hurtado
✭✭
1
Geometry
David Wood
Partial List Coloring
Iradmusa
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Vertex Coloring of graph fractional powers
Iradmusa
✭✭✭
1
Graph Theory
Iradmusa
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
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
The additive basis conjecture
Jaeger
;
Linial
;
Payan
;
Tarsi
✭✭✭
0
Combinatorics
»
Matrices
mdevos
Unit vector flows
Jain
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Rank vs. Genus
Johnson
✭✭✭
0
Topology
Jesse Johnson
Jorgensen's Conjecture
Jorgensen
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
mdevos
The permanent conjecture
Kahn
✭✭
0
Combinatorics
»
Matrices
mdevos
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
Cube-Simplex conjecture
Kalai
✭✭✭
0
Geometry
»
Polytopes
mdevos
The Double Cap Conjecture
Kalai
✭✭
0
Combinatorics
Jon Noel
Big Line or Big Clique in Planar Point Sets
Kara
;
Por
;
Wood
✭✭
1
Geometry
David Wood
List Hadwiger Conjecture
Kawarabayashi
;
Mohar
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
David Wood
Jacobian Conjecture
Keller
✭✭✭
0
Geometry
»
Algebraic Geometry
Charles
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
Graph Theory
zitterbewegung
Partition of a cubic 3-connected graphs into paths of length 2.
Kelmans
✭✭
0
Graph Theory
»
Basic G.T.
»
Paths
fhavet
Which compact boundaryless 3-manifolds embed smoothly in the 4-sphere?
Kirby
✭✭✭
0
Topology
rybu
Jones' conjecture
Kloks
;
Lee
;
Liu
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
cmlee
Kneser–Poulsen conjecture
Kneser
;
Poulsen
✭✭✭
0
Geometry
tchow
Bounding the chromatic number of triangle-free graphs with fixed maximum degree
Kostochka
;
Reed
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Andrew King
Imbalance conjecture
Kozerenko
✭✭
0
Graph Theory
Sergiy Kozerenko
F_d versus F_{d+1}
Krajicek
✭✭✭
0
Logic
zitterbewegung
Kriesell's Conjecture
Kriesell
✭✭
0
Graph Theory
»
Basic G.T.
»
Connectivity
Jon Noel
Complexity of the H-factor problem.
Kühn
;
Osthus
✭✭
0
Graph Theory
»
Extremal G.T.
fhavet
Simultaneous partition of hypergraphs
Kühn
;
Osthus
✭✭
0
Graph Theory
»
Hypergraphs
fhavet
Magic square of squares
LaBar
✭✭
1
Number Theory
»
Computational N.T.
maxal
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
Graph Theory
fhavet
Concavity of van der Waerden numbers
Landman
✭✭
0
Combinatorics
»
Ramsey Theory
Bruce Landman
2-accessibility of primes
Landman
;
Robertson
✭✭
0
Combinatorics
vjungic
3-accessibility of Fibonacci numbers
Landman
;
Robertson
✭✭
0
Combinatorics
vjungic
Are there an infinite number of lucky primes?
Lazarus: Gardiner: Metropolis
;
Ulam
✭
1
Number Theory
»
Additive N.T.
cubola zaruka
Lindelöf hypothesis
Lindelöf
✭✭
0
Number Theory
»
Analytic N.T.
porton
Exponential Algorithms for Knapsack
Lipton
✭✭
1
Theoretical Comp. Sci.
»
Algorithms
dick lipton
Hamiltonian paths and cycles in vertex transitive graphs
Lovasz
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Lovász Path Removal Conjecture
Lovasz
✭✭
0
Graph Theory
fhavet
The intersection of two perfect matchings
Macajova
;
Skoviera
✭✭
0
Graph Theory
»
Basic G.T.
»
Matchings
mdevos
Subdivision of a transitive tournament in digraphs with large outdegree.
Mader
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Blatter-Specker Theorem for ternary relations
Makowsky
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Finite entailment of Positive Horn logic
Martin
✭✭
0
Logic
»
Finite Model Theory
LucSegoufin
Domination in plane triangulations
Matheson
;
Tarjan
✭✭
0
Graph Theory
»
Topological G.T.
mdevos
Weighted colouring of hexagonal graphs.
McDiarmid
;
Reed
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
« 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