Open Problem Garden
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
What is the largest graph of positive curvature?
DeVos
;
Mohar
✭
1
Topological G.T.
»
Planar graphs
mdevos
Geodesic cycles and Tutte's Theorem
Georgakopoulos
;
Sprüssel
✭✭
1
Basic G.T.
»
Cycles
Agelos
Coloring and immersion
Abu-Khzam
;
Langston
✭✭✭
1
Coloring
»
Vertex coloring
mdevos
Matchings extend to Hamiltonian cycles in hypercubes
Ruskey
;
Savage
✭✭
1
Basic G.T.
»
Matchings
Jirka
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Directed Graphs
nkorppi
End-Devouring Rays
Georgakopoulos
✭
1
Infinite Graphs
Agelos
Hamiltonicity of Cayley graphs
Rapaport-Strasser
✭✭✭
1
Basic G.T.
»
Cycles
tchow
Book Thickness of Subdivisions
Blankenship
;
Oporowski
✭✭
1
David Wood
3-Colourability of Arrangements of Great Circles
Felsner
;
Hurtado
;
Noy
;
Streinu
✭✭
1
Topological G.T.
»
Coloring
David Wood
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Basic G.T.
»
Cycles
arthur
Star chromatic index of complete graphs
Dvorak
;
Mohar
;
Samal
✭✭
1
Robert Samal
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
Extremal G.T.
shudeshijie
Vertex Coloring of graph fractional powers
Iradmusa
✭✭✭
1
Iradmusa
Obstacle number of planar graphs
Alpert
;
Koch
;
Laison
✭
1
Andrew King
Minimal graphs with a prescribed number of spanning trees
Azarija
;
Skrekovski
✭✭
1
azi
Mixing Circular Colourings
Brewster
;
Noel
✭
1
Coloring
»
Vertex coloring
Jon Noel
Choice Number of k-Chromatic Graphs of Bounded Order
Noel
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Earth-Moon Problem
Ringel
✭✭
1
Coloring
»
Vertex coloring
fhavet
Bounding the on-line choice number in terms of the choice number
Zhu
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Choosability of Graph Powers
Noel
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Almost all non-Hamiltonian 3-regular graphs are 1-connected
Haythorpe
✭✭
1
Basic G.T.
mhaythorpe
Fractional Hadwiger
Harvey
;
Reed
;
Seymour
;
Wood
✭✭
1
David Wood
Forcing a 2-regular minor
Reed
;
Wood
✭✭
1
Basic G.T.
»
Minors
David Wood
List Colourings of Complete Multipartite Graphs with 2 Big Parts
Allagan
✭✭
1
Coloring
»
Vertex coloring
Jon Noel
Weak saturation of the cube in the clique
Morrison
;
Noel
✭
1
Extremal G.T.
Jon Noel
Monochromatic vertex colorings inherited from Perfect Matchings
✭✭✭
1
Mario Krenn
3-Edge-Coloring Conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
arthur
Cores of Cayley graphs
Samal
✭✭✭✭✭
0
Coloring
»
Homomorphisms
Robert Samal
5-flow conjecture
Tutte
✭✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
4-flow conjecture
Tutte
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
3-flow conjecture
Tutte
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Jaeger's modular orientation conjecture
Jaeger
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Bouchet's 6-flow conjecture
Bouchet
✭✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
The three 4-flows conjecture
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
A homomorphism problem for flows
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Real roots of the flow polynomial
Welsh
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Unit vector flows
Jain
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Cycle double cover conjecture
Seymour
;
Szekeres
✭✭✭✭
0
Basic G.T.
»
Cycles
mdevos
The circular embedding conjecture
Haggard
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
(m,n)-cycle covers
Celmins
;
Preissmann
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Faithful cycle covers
Seymour
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
Decomposing eulerian graphs
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
The Berge-Fulkerson conjecture
Berge
;
Fulkerson
✭✭✭✭
0
Basic G.T.
»
Matchings
mdevos
Petersen coloring conjecture
Jaeger
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Packing T-joins
DeVos
✭✭
0
Coloring
»
Edge coloring
mdevos
Acyclic edge-colouring
Fiamcik
✭✭
0
Coloring
»
Edge coloring
mdevos
Partitioning edge-connectivity
DeVos
✭✭
0
Basic G.T.
»
Connectivity
mdevos
Highly connected graphs with no K_n minor
Thomas
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Jorgensen's Conjecture
Jorgensen
✭✭✭
0
Basic G.T.
»
Minors
mdevos
The stubborn list partition problem
Cameron
;
Eschen
;
Hoang
;
Sritharan
✭✭
0
Graph Algorithms
mdevos
1
2
3
4
5
next ›
last »
Navigate
more
Recent Activity
3-Edge-Coloring Conjecture
Several ways to apply a (multivalued) multiargument function to a family of filters
Jones' conjecture
Multicolour Erdős--Hajnal Conjecture
Sidorenko's Conjecture
more