Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Sets with distinct subset sums
Erdos
✭✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Turán Problem for $10$-Cycles in the Hypercube
Erdos
✭✭
0
Combinatorics
Jon Noel
Fat 4-polytopes
Eppstein
;
Kuperberg
;
Ziegler
✭✭✭
0
Geometry
»
Polytopes
mdevos
Something like Picard for 1-forms
Elsner
✭✭
0
Analysis
MathOMan
Star chromatic index of cubic graphs
Dvorak
;
Mohar
;
Samal
✭✭
0
Graph Theory
Robert Samal
Star chromatic index of complete graphs
Dvorak
;
Mohar
;
Samal
✭✭
1
Graph Theory
Robert Samal
Durer's Conjecture
Durer
;
Shephard
✭✭✭
1
Geometry
»
Polytopes
dmoskovich
Dirac's Conjecture
Dirac
✭✭
0
Geometry
David Wood
Ding's tau_r vs. tau conjecture
Ding
✭✭✭
0
Combinatorics
»
Optimization
mdevos
Characterizing (aleph_0,aleph_1)-graphs
Diestel
;
Leader
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
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
Drawing disconnected graphs on surfaces
DeVos
;
Mohar
;
Samal
✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
mdevos
What is the largest graph of positive curvature?
DeVos
;
Mohar
✭
1
Graph Theory
»
Topological G.T.
»
Planar graphs
mdevos
Circular colouring the orthogonality graph
DeVos
;
Ghebleh
;
Goddyn
;
Mohar
;
Naserasr
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
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
Polignac's Conjecture
de Polignac
✭✭✭
0
Number Theory
Hugh Barker
Monotone 4-term Arithmetic Progressions
Davis
;
Entringer
;
Graham
;
Simmons
✭✭
0
Combinatorics
vjungic
Dividing up the unrestricted partitions
David S.
;
Newman
✭✭
0
Combinatorics
DavidSNewman
Hilbert-Smith conjecture
David Hilbert
;
Paul A. Smith
✭✭
0
Topology
porton
The 4x5 chessboard complex is the complement of a link, which link?
David Eppstein
✭✭
0
Topology
rybu
Lonely runner conjecture
Cusick
;
Wills
✭✭✭
0
Number Theory
mdevos
Unfriendly partitions
Cowan
;
Emerson
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Monadic second-order logic with cardinality predicates
Courcelle
✭✭
0
Logic
»
Finite Model Theory
dberwanger
P vs. NP
Cook
;
Levin
✭✭✭✭
0
Theoretical Comp. Sci.
»
Algorithms
zitterbewegung
Rainbow AP(4) in an almost equinumerous coloring
Conlon
✭✭
0
Combinatorics
vjungic
The 3n+1 conjecture
Collatz
✭✭✭
0
Number Theory
»
Combinatorial N.T.
dododododo
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Graph Theory
»
Directed Graphs
mdevos
Chowla's cosine problem
Chowla
✭✭✭
0
Number Theory
mdevos
Wide partition conjecture
Chow
;
Taylor
✭✭
0
Combinatorics
tchow
Closing Lemma for Diffeomorphism (Dynamical Systems)
Charles Pugh
✭✭✭✭
0
Topology
Jailton Viana
(m,n)-cycle covers
Celmins
;
Preissmann
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
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
Cores of strongly regular graphs
Cameron
;
Kazanidis
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
The stubborn list partition problem
Cameron
;
Eschen
;
Hoang
;
Sritharan
✭✭
0
Graph Theory
»
Graph Algorithms
mdevos
Caccetta-Häggkvist Conjecture
Caccetta
;
Häggkvist
✭✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Burnside problem
Burnside
✭✭✭✭
0
Group Theory
dlh12
Coloring random subgraphs
Bukh
✭✭
0
Graph Theory
»
Probabilistic G.T.
mdevos
Realisation problem for the space of knots in the 3-sphere
Budney
✭✭
0
Topology
rybu
Quartic rationally derived polynomials
Buchholz
;
MacDougall
✭✭✭
0
Number Theory
mdevos
The large sets conjecture
Brown
;
Graham
;
Landman
✭✭✭
0
Combinatorics
»
Ramsey Theory
vjungic
« 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