Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
The Crossing Number of the Complete Graph
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
Robert Samal
The Crossing Number of the Complete Bipartite Graph
Turan
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Crossing numbers
Robert Samal
The circular embedding conjecture
Haggard
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
The Borodin-Kostochka Conjecture
Borodin
;
Kostochka
✭✭
0
Graph Theory
Andrew King
The Bollobás-Eldridge-Catlin Conjecture on graph packing
✭✭✭
0
Graph Theory
»
Extremal G.T.
asp
The Bermond-Thomassen Conjecture
Bermond
;
Thomassen
✭✭
0
Graph Theory
»
Directed Graphs
JS
The Berge-Fulkerson conjecture
Berge
;
Fulkerson
✭✭✭✭
0
Graph Theory
»
Basic G.T.
»
Matchings
mdevos
The Alon-Tarsi basis conjecture
Alon
;
Linial
;
Meshulam
✭✭
0
Combinatorics
»
Matrices
mdevos
The additive basis conjecture
Jaeger
;
Linial
;
Payan
;
Tarsi
✭✭✭
0
Combinatorics
»
Matrices
mdevos
The 4x5 chessboard complex is the complement of a link, which link?
David Eppstein
✭✭
0
Topology
rybu
The 3n+1 conjecture
Collatz
✭✭✭
0
Number Theory
»
Combinatorial N.T.
dododododo
Termination of the sixth Goodstein Sequence
Graham
✭
0
Logic
mdevos
Tarski's exponential function problem
Tarski
✭✭
0
Logic
Charles
Switching reconstruction of digraphs
Bondy
;
Mercier
✭✭
0
Graph Theory
fhavet
Switching reconstruction conjecture
Stanley
✭✭
0
Graph Theory
fhavet
Sums of independent random variables with unbounded variance
Feige
✭✭
0
Theoretical Comp. Sci.
cwenner
Sum of prime and semiprime conjecture
Geoffrey Marnell
✭✭
0
Number Theory
princeps
Subset-sums equality (pigeonhole version)
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
mdevos
Subgroup formed by elements of order dividing n
Frobenius
✭✭
0
Group Theory
dlh12
Subgraph of large average degree and large girth.
Thomassen
✭✭
0
Graph Theory
»
Basic G.T.
fhavet
Subdivision of a transitive tournament in digraphs with large outdegree.
Mader
✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Sub-atomic product of funcoids is a categorical product
✭✭
0
Algebra
porton
Strong matchings and covers
Aharoni
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Strong edge colouring conjecture
Erdos
;
Nesetril
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
fhavet
Strong colorability
Aharoni
;
Alon
;
Haxell
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
berger
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Graph Theory
»
Basic G.T.
»
Cycles
arthur
Strict inequalities for products of filters
Porton
✭
0
Topology
porton
Sticky Cantor sets
✭✭
0
Topology
porton
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
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
Graph Theory
fhavet
Square achievement game on an n x n grid
Erickson
✭✭
1
Combinatorics
Martin Erickson
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Graph Theory
»
Directed Graphs
fhavet
Special Primes
George BALAN
✭
1
Number Theory
maththebalans
Something like Picard for 1-forms
Elsner
✭✭
0
Analysis
MathOMan
Snevily's conjecture
Snevily
✭✭✭
1
Number Theory
»
Combinatorial N.T.
mdevos
Smooth 4-dimensional Schoenflies problem
Alexander
✭✭✭✭
0
Topology
rybu
Smooth 4-dimensional Poincare conjecture
Poincare
;
Smale
;
Stallings
✭✭✭✭
0
Topology
rybu
Slice-ribbon problem
Fox
✭✭✭✭
0
Topology
rybu
Singmaster's conjecture
Singmaster
✭✭
1
Number Theory
»
Combinatorial N.T.
Zach Teitler
Simultaneous partition of hypergraphs
Kühn
;
Osthus
✭✭
0
Graph Theory
»
Hypergraphs
fhavet
Simplexity of the n-cube
✭✭✭
1
Geometry
mdevos
Signing a graph to have small magnitude eigenvalues
Bilu
;
Linial
✭✭
0
Graph Theory
mdevos
Sidorenko's Conjecture
Sidorenko
✭✭✭
0
Graph Theory
Jon Noel
Shuffle-Exchange Conjecture (graph-theoretic form)
Beneš
;
Folklore
;
Stone
✭✭✭
0
Graph Theory
Vadim Lioubimov
Shuffle-Exchange Conjecture
Beneš
;
Folklore
;
Stone
✭✭✭
0
Combinatorics
Vadim Lioubimov
Shannon capacity of the seven-cycle
✭✭✭
0
Graph Theory
tchow
Seymour's self-minor conjecture
Seymour
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Graph Theory
»
Directed Graphs
nkorppi
Seymour's r-graph conjecture
Seymour
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
« 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