Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Covering systems with big moduli
Erdos
;
Selfridge
✭✭
0
Number Theory
»
Combinatorial N.T.
Robert Samal
Oriented chromatic number of planar graphs
✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Robert Samal
The intersection of two perfect matchings
Macajova
;
Skoviera
✭✭
0
Graph Theory
»
Basic G.T.
»
Matchings
mdevos
¿Are critical k-forests tight?
Strausz
✭✭
0
Graph Theory
»
Hypergraphs
Dino
Three-chromatic (0,2)-graphs
Payan
✭✭
0
Graph Theory
»
Coloring
Gordon Royle
Davenport's constant
✭✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
What is the smallest number of disjoint spanning trees made a graph Hamiltonian
Goldengorin
✭✭
0
Graph Theory
»
Extremal G.T.
boris
The Riemann Hypothesis
Riemann
✭✭✭✭
0
Number Theory
»
Analytic N.T.
eric
Rendezvous on a line
Alpern
✭✭✭
0
Unsorted
mdevos
Pebbling a cartesian product
Graham
✭✭✭
0
Graph Theory
mdevos
Linear Hypergraphs with Dimension 3
Ossona de Mendez
;
Rosenstiehl
;
de Fraysseix
✭✭
0
Graph Theory
»
Topological G.T.
»
Drawings
taxipom
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
The Bermond-Thomassen Conjecture
Bermond
;
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
JS
Coloring the Odd Distance Graph
Rosenfeld
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Monotone 4-term Arithmetic Progressions
Davis
;
Entringer
;
Graham
;
Simmons
✭✭
0
Combinatorics
vjungic
Universal Steiner triple systems
Grannell
;
Griggs
;
Knor
;
Skoviera
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
macajova
Even vs. odd latin squares
Alon
;
Tarsi
✭✭✭
0
Combinatorics
mdevos
Jones' conjecture
Kloks
;
Lee
;
Liu
✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
cmlee
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
Graph Theory
zitterbewegung
F_d versus F_{d+1}
Krajicek
✭✭✭
0
Logic
zitterbewegung
P vs. NP
Cook
;
Levin
✭✭✭✭
0
Theoretical Comp. Sci.
»
Algorithms
zitterbewegung
Universal highly arc transitive digraphs
Cameron
;
Praeger
;
Wormald
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Unfriendly partitions
Cowan
;
Emerson
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Strong matchings and covers
Aharoni
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Highly arc transitive two ended digraphs
Cameron
;
Praeger
;
Wormald
✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Equality in a matroidal circumference bound
Oxley
;
Royle
✭✭
0
Combinatorics
»
Matroid Theory
Gordon Royle
Ding's tau_r vs. tau conjecture
Ding
✭✭✭
0
Combinatorics
»
Optimization
mdevos
Chords of longest cycles
Thomassen
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Growth of finitely presented groups
Adyan
✭✭✭
0
Group Theory
mdevos
Goldbach conjecture
Goldbach
✭✭✭✭
0
Number Theory
»
Additive N.T.
Benschop
$C^r$ Stability Conjecture
Palis
;
Smale
✭✭✭✭
0
Analysis
m n
Seagull problem
Seymour
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
mdevos
Subgroup formed by elements of order dividing n
Frobenius
✭✭
0
Group Theory
dlh12
Chowla's cosine problem
Chowla
✭✭✭
0
Number Theory
mdevos
Random stable roommates
Mertens
✭✭
0
Graph Theory
»
Basic G.T.
»
Matchings
mdevos
S(S(f)) = S(f) for reloids
Porton
✭✭
0
Topology
porton
Inscribed Square Problem
Toeplitz
✭✭
0
Topology
dlh12
Burnside problem
Burnside
✭✭✭✭
0
Group Theory
dlh12
Combinatorial covering designs
Gordon
;
Mills
;
Rödl
;
Schönheim
✭
0
Combinatorics
»
Designs
Pseudonym
Partial List Coloring
Albertson
;
Grossman
;
Haas
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Cube-Simplex conjecture
Kalai
✭✭✭
0
Geometry
»
Polytopes
mdevos
Partial List Coloring
Iradmusa
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
Iradmusa
Quartic rationally derived polynomials
Buchholz
;
MacDougall
✭✭✭
0
Number Theory
mdevos
Degenerate colorings of planar graphs
Borodin
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
Nearly spanning regular subgraphs
Alon
;
Mubayi
✭✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Edge Reconstruction Conjecture
Harary
✭✭✭
0
Graph Theory
melch
Hedetniemi's Conjecture
Hedetniemi
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Total Colouring Conjecture
Behzad
✭✭✭
0
Graph Theory
»
Coloring
Iradmusa
Wall-Sun-Sun primes and Fibonacci divisibility
✭✭
0
Number Theory
»
Computational N.T.
adudzik
« 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