Open Problem Garden
Help
About
Contact
login/create account
Home
Open Problems
Title
Author(s)
Imp.¹
Rec.²
Area » Topic » Subtopic
Posted by
Choosability of Graph Powers
Noel
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Almost all non-Hamiltonian 3-regular graphs are 1-connected
Haythorpe
✭✭
1
Graph Theory
»
Basic G.T.
mhaythorpe
Partitioning the Projective Plane
Noel
✭✭
1
Geometry
Jon Noel
Fractional Hadwiger
Harvey
;
Reed
;
Seymour
;
Wood
✭✭
1
Graph Theory
David Wood
Forcing a 2-regular minor
Reed
;
Wood
✭✭
1
Graph Theory
»
Basic G.T.
»
Minors
David Wood
Generalised Empty Hexagon Conjecture
Wood
✭✭
1
Geometry
David Wood
List Colourings of Complete Multipartite Graphs with 2 Big Parts
Allagan
✭✭
1
Graph Theory
»
Coloring
»
Vertex coloring
Jon Noel
Saturated $k$-Sperner Systems of Minimum Size
Morrison
;
Noel
;
Scott
✭✭
1
Combinatorics
»
Posets
Jon Noel
Chromatic number of associahedron
Fabila-Monroy
;
Flores-Penaloza
;
Huemer
;
Hurtado
;
Urrutia
;
Wood
✭✭
1
Geometry
David Wood
Convex Equipartitions with Extreme Perimeter
Nandakumar
✭✭
1
Geometry
Nandakumar
Weak saturation of the cube in the clique
Morrison
;
Noel
✭
1
Graph Theory
»
Extremal G.T.
Jon Noel
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Graph Theory
Mario Krenn
Singmaster's conjecture
Singmaster
✭✭
1
Number Theory
»
Combinatorial N.T.
Zach Teitler
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Graph Theory
arthur
Cores of Cayley graphs
Samal
✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
Robert Samal
5-flow conjecture
Tutte
✭✭✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
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 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
Real roots of the flow polynomial
Welsh
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Unit vector flows
Jain
✭✭
0
Graph Theory
»
Coloring
»
Nowhere-zero flows
mdevos
Cycle double cover conjecture
Seymour
;
Szekeres
✭✭✭✭
0
Graph Theory
»
Basic G.T.
»
Cycles
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
The Berge-Fulkerson conjecture
Berge
;
Fulkerson
✭✭✭✭
0
Graph Theory
»
Basic G.T.
»
Matchings
mdevos
Petersen coloring conjecture
Jaeger
✭✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Packing T-joins
DeVos
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Acyclic edge-colouring
Fiamcik
✭✭
0
Graph Theory
»
Coloring
»
Edge coloring
mdevos
Partitioning edge-connectivity
DeVos
✭✭
0
Graph Theory
»
Basic G.T.
»
Connectivity
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
The permanent conjecture
Kahn
✭✭
0
Combinatorics
»
Matrices
mdevos
The Alon-Tarsi basis conjecture
Alon
;
Linial
;
Meshulam
✭✭
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
Olson's Conjecture
Olson
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
Few subsequence sums in Z_n x Z_n
Bollobas
;
Leader
✭✭
0
Number Theory
»
Combinatorial N.T.
mdevos
The stubborn list partition problem
Cameron
;
Eschen
;
Hoang
;
Sritharan
✭✭
0
Graph Theory
»
Graph Algorithms
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
Graham's conjecture on tree reconstruction
Graham
✭✭
0
Graph Theory
»
Basic G.T.
mdevos
Ryser's conjecture
Ryser
✭✭✭
0
Graph Theory
»
Hypergraphs
mdevos
Pentagon problem
Nesetril
✭✭✭
0
Graph Theory
»
Coloring
»
Homomorphisms
Robert Samal
« 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