Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Fixed-point logic with counting
Blass
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Few subsequence sums in Z_n x Z_n
Bollobas
;
Leader
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Cyclic spanning subdigraph with small cyclomatic number
Bondy
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Switching reconstruction of digraphs
Bondy
;
Mercier
✭✭
0
Graph Theory
fhavet
Degenerate colorings of planar graphs
Borodin
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
Acyclic list colouring of planar graphs.
Borodin
;
Fon-Der-Flasss
;
Kostochka
;
Raspaud
;
Sopena
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
The Borodin-Kostochka Conjecture
Borodin
;
Kostochka
✭✭
0
Graph Theory
Andrew King
List Total Colouring Conjecture
Borodin
;
Kostochka
;
Woodall
✭✭
0
Graph Theory
»
Coloring
Jon Noel
Bouchet's 6-flow conjecture
Bouchet
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Cycles in Graphs of Large Chromatic Number
Brewster
;
McGuinness
;
Moore
;
Noel
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Mixing Circular Colourings
Brewster
;
Noel
✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
The large sets conjecture
Brown
;
Graham
;
Landman
✭✭✭
0
Combinatorics
»
Ramsey Theory
vjungic
Quartic rationally derived polynomials
Buchholz
;
MacDougall
✭✭✭
0
Number Theory
mdevos
Realisation problem for the space of knots in the 3-sphere
Budney
✭✭
0
Topology
rybu
Coloring random subgraphs
Bukh
✭✭
0
Graph Theory
»
Probabilistic G.T.
mdevos
Burnside problem
Burnside
✭✭✭✭
0
Group Theory
dlh12
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
The stubborn list partition problem
Cameron
;
Eschen
;
Hoang
;
Sritharan
✭✭
0
Graph Theory
»
Graph Algorithms
mdevos
Cores of strongly regular graphs
Cameron
;
Kazanidis
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Universal highly arc transitive digraphs
Cameron
;
Praeger
;
Wormald
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Highly arc transitive two ended digraphs
Cameron
;
Praeger
;
Wormald
✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
(m,n)-cycle covers
Celmins
;
Preissmann
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Closing Lemma for Diffeomorphism (Dynamical Systems)
Charles Pugh
✭✭✭✭
0
Topology
Jailton Viana
Wide partition conjecture
Chow
;
Taylor
✭✭
0
Combinatorics
tchow
Chowla's cosine problem
Chowla
✭✭✭
0
Number Theory
mdevos
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Graph Theory
»
Directed Graphs
mdevos
The 3n+1 conjecture
Collatz
✭✭✭
0
Number Theory
»
Combinatorial N.T.
dododododo
Rainbow AP(4) in an almost equinumerous coloring
Conlon
✭✭
0
Combinatorics
vjungic
P vs. NP
Cook
;
Levin
✭✭✭✭
0
Theoretical Comp. Sci.
»
Algorithms
zitterbewegung
Monadic second-order logic with cardinality predicates
Courcelle
✭✭
0
Logic
»
Finite Model Theory
dberwanger
Unfriendly partitions
Cowan
;
Emerson
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Lonely runner conjecture
Cusick
;
Wills
✭✭✭
0
Number Theory
mdevos
The 4x5 chessboard complex is the complement of a link, which link?
David Eppstein
✭✭
0
Topology
rybu
Hilbert-Smith conjecture
David Hilbert
;
Paul A. Smith
✭✭
0
Topology
porton
Dividing up the unrestricted partitions
David S.
;
Newman
✭✭
0
Combinatorics
DavidSNewman
Monotone 4-term Arithmetic Progressions
Davis
;
Entringer
;
Graham
;
Simmons
✭✭
0
Combinatorics
vjungic
Polignac's Conjecture
de Polignac
✭✭✭
0
Number Theory
Hugh Barker
The three 4-flows conjecture
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
A homomorphism problem for flows
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Packing T-joins
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Partitioning edge-connectivity
DeVos
✭✭
0
Graph Theory
»
Basic G.T.
»
Connectivity
mdevos
Antichains in the cycle continuous order
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Gao's theorem for nonabelian groups
DeVos
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
5-local-tensions
DeVos
✭✭
0
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
Friendly partitions
DeVos
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Circular colouring the orthogonality graph
DeVos
;
Ghebleh
;
Goddyn
;
Mohar
;
Naserasr
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
What is the largest graph of positive curvature?
DeVos
;
Mohar
✭
1
Graph Theory
»
Topological G.T.
»
Planar graphs
mdevos
Drawing disconnected graphs on surfaces
DeVos
;
Mohar
;
Samal
✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
mdevos
Average diameter of a bounded cell of a simple arrangement
Deza
;
Terlaky
;
Zinchenko
✭✭
0
Geometry
deza
« first
‹ previous
…
5
6
7
8
9
10
11
12
13
…
next ›
last »
Navigate
Subject
Algebra
(295)
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
Nowhere-zero flows
Shuffle-Exchange Conjecture
Algebra
Seagull problem
Solution to the Lonely Runner Conjecture
more