Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Cores of strongly regular graphs
Cameron
;
Kazanidis
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Counterexamples to the Baillie-PSW primality test
✭✭
1
Number Theory
»
Computational N.T.
maxal
Counting 3-colorings of the hex lattice
Thomassen
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Covering a square with unit squares
✭✭
0
Geometry
Martin Erickson
Covering powers of cycles with equivalence subgraphs
✭
0
Graph Theory
Andrew King
Covering systems with big moduli
Erdos
;
Selfridge
✭✭
0
Number Theory
»
Combinatorial N.T.
Robert Samal
Criterion for boundedness of power series
Rüdinger
✭
1
Analysis
andreasruedinger
Crossing numbers and coloring
Albertson
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
mdevos
Crossing sequences
Archdeacon
;
Bonnington
;
Siran
✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
Robert Samal
Cube-Simplex conjecture
Kalai
✭✭✭
0
Geometry
»
Polytopes
mdevos
Cycle double cover conjecture
Seymour
;
Szekeres
✭✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Cycle Double Covers Containing Predefined 2-Regular Subgraphs
Arthur
;
Hoffmann-Ostenhof
✭✭✭
0
Graph Theory
arthur
Cycles in Graphs of Large Chromatic Number
Brewster
;
McGuinness
;
Moore
;
Noel
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Cyclic spanning subdigraph with small cyclomatic number
Bondy
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Davenport's constant
✭✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Decomposing a connected graph into paths.
Gallai
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Paths
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
Decomposing an eulerian graph into cycles.
Hajós
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
fhavet
Decomposing an even tournament in directed paths.
Alspach
;
Mason
;
Pullman
✭✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Decomposing eulerian graphs
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Decomposing k-arc-strong tournament into k spanning strong digraphs
Bang-Jensen
;
Yeo
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Decomposition of completions of reloids
Porton
✭✭
0
Topology
porton
Degenerate colorings of planar graphs
Borodin
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
Dense rational distance sets in the plane
Ulam
✭✭✭
0
Geometry
mdevos
Diagonal Ramsey numbers
Erdos
✭✭✭✭
0
Combinatorics
»
Ramsey Theory
mdevos
Ding's tau_r vs. tau conjecture
Ding
✭✭✭
0
Combinatorics
»
Optimization
mdevos
Diophantine quintuple conjecture
✭✭
1
Number Theory
maxal
Dirac's Conjecture
Dirac
✭✭
0
Geometry
David Wood
Direct proof of a theorem about compact funcoids
Porton
✭✭
0
Topology
porton
Directed path of length twice the minimum outdegree
Thomassé
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Discrete Logarithm Problem
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
cplxphil
Distribution and upper bound of mimic numbers
Bhattacharyya
✭✭
1
Number Theory
»
Analytic N.T.
facility_cttb@i...
Dividing up the unrestricted partitions
David S.
;
Newman
✭✭
0
Combinatorics
DavidSNewman
Divisibility of central binomial coefficients
Graham
✭✭
1
Number Theory
»
Combinatorial N.T.
maxal
Do any three longest paths in a connected graph have a vertex in common?
Gallai
✭✭
0
Graph Theory
fhavet
Does the chromatic symmetric function distinguish between trees?
Stanley
✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Domination in cubic graphs
Reed
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Domination in plane triangulations
Matheson
;
Tarjan
✭✭
0
Graph Theory
»
Topological G.T.
mdevos
Double-critical graph conjecture
Erdos
;
Lovasz
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
DFR
Drawing disconnected graphs on surfaces
DeVos
;
Mohar
;
Samal
✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
mdevos
Durer's Conjecture
Durer
;
Shephard
✭✭✭
1
Geometry
»
Polytopes
dmoskovich
Earth-Moon Problem
Ringel
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
fhavet
Edge list coloring conjecture
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
tchow
Edge Reconstruction Conjecture
Harary
✭✭✭
0
Graph Theory
melch
Edge-antipodal colorings of cubes
Norine
✭✭
0
Combinatorics
»
Ramsey Theory
mdevos
Edge-Colouring Geometric Complete Graphs
Hurtado
✭✭
1
Geometry
David Wood
Edge-disjoint Hamilton cycles in highly strongly connected tournaments.
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
»
Tournaments
fhavet
Edge-Unfolding Convex Polyhedra
Shephard
✭✭
0
Geometry
Erik Demaine
Elementary symmetric of a sum of matrices
✭✭✭
0
Algebra
rscosa
End-Devouring Rays
Georgakopoulos
✭
1
Graph Theory
»
Infinite Graphs
Agelos
« 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