Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
A diagram about funcoids and reloids
Porton
✭✭
0
Topology
porton
Which outer reloids are equal to inner ones
Porton
✭✭
0
Topology
porton
Waring rank of determinant
Teitler
✭✭
0
Algebra
Zach Teitler
Singmaster's conjecture
Singmaster
✭✭
1
Number Theory
»
Combinatorial N.T.
Zach Teitler
Edge-Unfolding Convex Polyhedra
Shephard
✭✭
0
Geometry
Erik Demaine
Chromatic number of $\frac{3}{3}$-power of graph
✭✭
0
Graph Theory
Iradmusa
4-flow conjecture
Tutte
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
3-flow conjecture
Tutte
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Jaeger's modular orientation conjecture
Jaeger
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Bouchet's 6-flow conjecture
Bouchet
✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
The circular embedding conjecture
Haggard
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
(m,n)-cycle covers
Celmins
;
Preissmann
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Faithful cycle covers
Seymour
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Decomposing eulerian graphs
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
mdevos
Petersen coloring conjecture
Jaeger
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
A nowhere-zero point in a linear mapping
Jaeger
✭✭✭
0
Combinatorics
»
Matrices
mdevos
The additive basis conjecture
Jaeger
;
Linial
;
Payan
;
Tarsi
✭✭✭
0
Combinatorics
»
Matrices
mdevos
Highly connected graphs with no K_n minor
Thomas
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
mdevos
Jorgensen's Conjecture
Jorgensen
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Minors
mdevos
57-regular Moore graph?
Hoffman
;
Singleton
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Hamiltonian paths and cycles in vertex transitive graphs
Lovasz
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
The Erdös-Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Extremal G.T.
mdevos
Subset-sums equality (pigeonhole version)
✭✭✭
0
Theoretical Comp. Sci.
»
Complexity
mdevos
Ryser's conjecture
Ryser
✭✭✭
0
Graph Theory
»
Hypergraphs
mdevos
Pentagon problem
Nesetril
✭✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
Robert Samal
Linial-Berge path partition duality
Berge
;
Linial
✭✭✭
0
Graph Theory
»
Coloring
berger
Strong colorability
Aharoni
;
Alon
;
Haxell
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
berger
Consecutive non-orientable embedding obstructions
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Genus
Bruce Richter
Grunbaum's Conjecture
Grunbaum
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Coloring
mdevos
Woodall's Conjecture
Woodall
✭✭✭
0
Graph Theory
»
Directed Graphs
mdevos
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
Fat 4-polytopes
Eppstein
;
Kuperberg
;
Ziegler
✭✭✭
0
Geometry
»
Polytopes
mdevos
Universal point sets for planar graphs
Mohar
✭✭✭
0
Graph Theory
»
Topological G.T.
»
Drawings
mdevos
Seymour's self-minor conjecture
Seymour
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Reed's omega, delta, and chi conjecture
Reed
✭✭✭
0
Graph Theory
»
Coloring
»
Vertex coloring
mdevos
Triangle free strongly regular graphs
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
Unions of triangle free graphs
Erdos
;
Hajnal
✭✭✭
0
Graph Theory
»
Infinite Graphs
mdevos
Rota's unimodal conjecture
Rota
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
Bases of many weights
Schrijver
;
Seymour
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
Ramsey properties of Cayley graphs
Alon
✭✭✭
0
Graph Theory
»
Algebraic G.T.
mdevos
The large sets conjecture
Brown
;
Graham
;
Landman
✭✭✭
0
Combinatorics
»
Ramsey Theory
vjungic
Aharoni-Berger conjecture
Aharoni
;
Berger
✭✭✭
0
Combinatorics
»
Matroid Theory
mdevos
Barnette's Conjecture
Barnette
✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
Robert Samal
Mapping planar graphs to odd cycles
Jaeger
✭✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
mdevos
Sets with distinct subset sums
Erdos
✭✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Lonely runner conjecture
Cusick
;
Wills
✭✭✭
0
Number Theory
mdevos
The 3n+1 conjecture
Collatz
✭✭✭
0
Number Theory
»
Combinatorial N.T.
dododododo
Graceful Tree Conjecture
✭✭✭
0
Graph Theory
»
Coloring
»
Labeling
kintali
The robustness of the tensor product
Ben-Sasson
;
Sudan
✭✭✭
0
Theoretical Comp. Sci.
»
Coding Theory
ormeir
« 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