Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
General position subsets
Gowers
✭✭
0
Geometry
David Wood
Generalised Empty Hexagon Conjecture
Wood
✭✭
1
Geometry
David Wood
List Hadwiger Conjecture
Kawarabayashi
;
Mohar
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
David Wood
Chromatic Number of Common Graphs
Hatami
;
Hladký
;
Kráľ
;
Norine
;
Razborov
✭✭
0
Graph Theory
David Wood
Chromatic number of associahedron
Fabila-Monroy
;
Flores-Penaloza
;
Huemer
;
Hurtado
;
Urrutia
;
Wood
✭✭
1
Geometry
David Wood
Perfect 2-error-correcting codes over arbitrary finite alphabets.
✭✭
0
Combinatorics
»
Codes
davidcullen
Dividing up the unrestricted partitions
David S.
;
Newman
✭✭
0
Combinatorics
DavidSNewman
Fixed-point logic with counting
Blass
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Order-invariant queries
Segoufin
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Monadic second-order logic with cardinality predicates
Courcelle
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Blatter-Specker Theorem for ternary relations
Makowsky
✭✭
0
Logic
»
Finite Model Theory
dberwanger
MSO alternation hierarchy over pictures
Grandjean
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Vertex Cover Integrality Gap
Atserias
✭✭
0
Logic
»
Finite Model Theory
dberwanger
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
Double-critical graph conjecture
Erdos
;
Lovasz
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
DFR
Exponential Algorithms for Knapsack
Lipton
✭✭
1
Theoretical Comp. Sci.
»
Algorithms
dick lipton
¿Are critical k-forests tight?
Strausz
✭✭
0
Graph Theory
»
Hypergraphs
Dino
Subgroup formed by elements of order dividing n
Frobenius
✭✭
0
Group Theory
dlh12
Inscribed Square Problem
Toeplitz
✭✭
0
Topology
dlh12
Burnside problem
Burnside
✭✭✭✭
0
Group Theory
dlh12
Durer's Conjecture
Durer
;
Shephard
✭✭✭
1
Geometry
»
Polytopes
dmoskovich
The 3n+1 conjecture
Collatz
✭✭✭
0
Number Theory
»
Combinatorial N.T.
dododododo
Good Edge Labelings
Araújo
;
Cohen
;
Giroire
;
Havet
✭✭
0
Graph Theory
»
Coloring
»
Labeling
DOT
Extension complexity of (convex) polygons
✭✭
0
Geometry
»
Polytopes
DOT
Chromatic number of random lifts of complete graphs
Amit
✭✭
0
Graph Theory
»
Probabilistic G.T.
DOT
Circular flow number of regular class 1 graphs
Steffen
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
Eckhard Steffen
Circular flow numbers of $r$-graphs
Steffen
✭✭
0
Graph Theory
Eckhard Steffen
The Riemann Hypothesis
Riemann
✭✭✭✭
0
Number Theory
»
Analytic N.T.
eric
Edge-Unfolding Convex Polyhedra
Shephard
✭✭
0
Geometry
Erik Demaine
Birch & Swinnerton-Dyer conjecture
✭✭✭✭
0
Number Theory
eyoong
Distribution and upper bound of mimic numbers
Bhattacharyya
✭✭
1
Number Theory
»
Analytic N.T.
facility_cttb@i...
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Antidirected trees in digraphs
Addario-Berry
;
Havet
;
Linhares Sales
;
Reed
;
Thomassé
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Ádám's Conjecture
Ádám
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
Graph Theory
fhavet
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Long directed cycles in diregular digraphs
Jackson
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Strong edge colouring conjecture
Erdos
;
Nesetril
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
fhavet
Arc-disjoint out-branching and in-branching
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Arc-disjoint strongly connected spanning subdigraphs
Bang-Jensen
;
Yeo
✭✭
0
Graph Theory
fhavet
Coloring the union of degenerate graphs
Tarsi
✭✭
0
Graph Theory
»
Coloring
fhavet
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
Decomposing an eulerian graph into cycles.
Hajós
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
Decomposing an eulerian graph into cycles with no two consecutives edges on a prescribed eulerian tour.
Sabidussi
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
Partition of a cubic 3-connected graphs into paths of length 2.
Kelmans
✭✭
0
Graph Theory
»
Basic G.T.
»
Paths
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