Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
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
Continous analogue of Hirsch conjecture
Deza
;
Terlaky
;
Zinchenko
✭✭
0
Geometry
»
Polytopes
deza
Characterizing (aleph_0,aleph_1)-graphs
Diestel
;
Leader
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Ding's tau_r vs. tau conjecture
Ding
✭✭✭
0
Combinatorics
»
Optimization
mdevos
Dirac's Conjecture
Dirac
✭✭
0
Geometry
David Wood
Durer's Conjecture
Durer
;
Shephard
✭✭✭
1
Geometry
»
Polytopes
dmoskovich
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
Something like Picard for 1-forms
Elsner
✭✭
0
Analysis
MathOMan
Fat 4-polytopes
Eppstein
;
Kuperberg
;
Ziegler
✭✭✭
0
Geometry
»
Polytopes
mdevos
Diagonal Ramsey numbers
Erdos
✭✭✭✭
0
Combinatorics
»
Ramsey Theory
mdevos
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
Erdős–Faber–Lovász conjecture
Erdos
;
Faber
;
Lovasz
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Odd-cycle transversal in triangle-free graphs
Erdos
;
Faudree
;
Pach
;
Spencer
✭✭
0
Graph Theory
»
Extremal G.T.
fhavet
The Crossing Number of the Hypercube
Erdos
;
Guy
✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
Robert Samal
The Erdös-Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Extremal G.T.
mdevos
Unions of triangle free graphs
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Extremal G.T.
Jon Noel
Double-critical graph conjecture
Erdos
;
Lovasz
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
DFR
Strong edge colouring conjecture
Erdos
;
Nesetril
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
fhavet
Odd incongruent covering systems
Erdos
;
Selfridge
✭✭✭
0
Number Theory
»
Combinatorial N.T.
Robert Samal
Covering systems with big moduli
Erdos
;
Selfridge
✭✭
0
Number Theory
»
Combinatorial N.T.
Robert Samal
Turán number of a finite family.
Erdos
;
Simonovits
✭✭
0
Graph Theory
fhavet
Erdős–Straus conjecture
Erdos
;
Straus
✭✭
1
Number Theory
ACW
Erdös-Szekeres conjecture
Erdos
;
Szekeres
✭✭✭
0
Geometry
mdevos
The Erdos-Turan conjecture on additive bases
Erdos
;
Turan
✭✭✭✭
0
Number Theory
»
Additive N.T.
mdevos
Sequence defined on multisets
Erickson
✭✭
1
Combinatorics
Martin Erickson
Square achievement game on an n x n grid
Erickson
✭✭
1
Combinatorics
Martin Erickson
Exact colorings of graphs
Erickson
✭✭
0
Graph Theory
Martin Erickson
Transversal achievement game on a square grid
Erickson
✭✭
1
Combinatorics
Martin Erickson
A sextic counterexample to Euler's sum of powers conjecture
Euler
✭✭
1
Number Theory
»
Computational N.T.
maxal
Chromatic number of associahedron
Fabila-Monroy
;
Flores-Penaloza
;
Huemer
;
Hurtado
;
Urrutia
;
Wood
✭✭
1
Geometry
David Wood
Refuting random 3SAT-instances on $O(n)$ clauses (weak form)
Feige
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
»
Hardness of Approximation
cwenner
Sums of independent random variables with unbounded variance
Feige
✭✭
0
Theoretical Comp. Sci.
cwenner
3-Colourability of Arrangements of Great Circles
Felsner
;
Hurtado
;
Noy
;
Streinu
✭✭
1
Graph Theory
»
Topological G.T.
»
Coloring
David Wood
Acyclic edge-colouring
Fiamcik
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
4-connected graphs are not uniquely hamiltonian
Fleischner
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
P vs. PSPACE
Folklore
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
cwenner
« 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