Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
Non-edges vs. feedback edge sets in digraphs
Chudnovsky
;
Seymour
;
Sullivan
✭✭✭
0
Directed Graphs
mdevos
Number of Cliques in Minor-Closed Classes
Wood
✭✭
0
David Wood
Obstacle number of planar graphs
Alpert
;
Koch
;
Laison
✭
1
Andrew King
Odd cycles and low oddness
✭✭
0
Gagik
Odd-cycle transversal in triangle-free graphs
Erdos
;
Faudree
;
Pach
;
Spencer
✭✭
0
Extremal G.T.
fhavet
Oriented chromatic number of planar graphs
✭✭
0
Coloring
»
Vertex coloring
Robert Samal
Oriented trees in n-chromatic digraphs
Burr
✭✭✭
0
Directed Graphs
fhavet
Packing T-joins
DeVos
✭✭
0
Coloring
»
Edge coloring
mdevos
Partial List Coloring
Albertson
;
Grossman
;
Haas
✭✭✭
0
Coloring
»
Vertex coloring
Iradmusa
Partial List Coloring
Iradmusa
✭✭✭
0
Coloring
»
Vertex coloring
Iradmusa
Partition of a cubic 3-connected graphs into paths of length 2.
Kelmans
✭✭
0
Basic G.T.
»
Paths
fhavet
Partitioning edge-connectivity
DeVos
✭✭
0
Basic G.T.
»
Connectivity
mdevos
Partitionning a tournament into k-strongly connected subtournaments.
Thomassen
✭✭
0
Directed Graphs
»
Tournaments
fhavet
Pebbling a cartesian product
Graham
✭✭✭
0
mdevos
Pentagon problem
Nesetril
✭✭✭
0
Coloring
»
Homomorphisms
Robert Samal
Petersen coloring conjecture
Jaeger
✭✭✭
0
Coloring
»
Edge coloring
mdevos
PTAS for feedback arc set in tournaments
Ailon
;
Alon
✭✭
0
Graph Algorithms
fhavet
r-regular graphs are not uniquely hamiltonian.
Sheehan
✭✭✭
0
Basic G.T.
»
Cycles
Robert Samal
Ramsey properties of Cayley graphs
Alon
✭✭✭
0
Algebraic G.T.
mdevos
Random stable roommates
Mertens
✭✭
0
Basic G.T.
»
Matchings
mdevos
Real roots of the flow polynomial
Welsh
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Reconstruction conjecture
Kelly
;
Ulam
✭✭✭✭
0
zitterbewegung
Reed's omega, delta, and chi conjecture
Reed
✭✭✭
0
Coloring
»
Vertex coloring
mdevos
Ryser's conjecture
Ryser
✭✭✭
0
Hypergraphs
mdevos
Seagull problem
Seymour
✭✭✭
0
Basic G.T.
»
Minors
mdevos
Seymour's r-graph conjecture
Seymour
✭✭✭
0
Coloring
»
Edge coloring
mdevos
Seymour's Second Neighbourhood Conjecture
Seymour
✭✭✭
1
Directed Graphs
nkorppi
Seymour's self-minor conjecture
Seymour
✭✭✭
0
Infinite Graphs
mdevos
Shannon capacity of the seven-cycle
✭✭✭
0
tchow
Shuffle-Exchange Conjecture (graph-theoretic form)
Beneš
;
Folklore
;
Stone
✭✭✭
0
Vadim Lioubimov
Sidorenko's Conjecture
Sidorenko
✭✭✭
0
Jon Noel
Signing a graph to have small magnitude eigenvalues
Bilu
;
Linial
✭✭
0
mdevos
Simultaneous partition of hypergraphs
Kühn
;
Osthus
✭✭
0
Hypergraphs
fhavet
Splitting a digraph with minimum outdegree constraints
Alon
✭✭✭
0
Directed Graphs
fhavet
Stable set meeting all longest directed paths.
Laborde
;
Payan
;
Xuong N.H.
✭✭
0
fhavet
Star chromatic index of complete graphs
Dvorak
;
Mohar
;
Samal
✭✭
1
Robert Samal
Star chromatic index of cubic graphs
Dvorak
;
Mohar
;
Samal
✭✭
0
Robert Samal
Strong 5-cycle double cover conjecture
Arthur
;
Hoffmann-Ostenhof
✭✭✭
1
Basic G.T.
»
Cycles
arthur
Strong colorability
Aharoni
;
Alon
;
Haxell
✭✭✭
0
Coloring
»
Vertex coloring
berger
Strong edge colouring conjecture
Erdos
;
Nesetril
✭✭
0
Coloring
»
Edge coloring
fhavet
Strong matchings and covers
Aharoni
✭✭✭
0
Infinite Graphs
mdevos
Subdivision of a transitive tournament in digraphs with large outdegree.
Mader
✭✭
0
Directed Graphs
fhavet
Subgraph of large average degree and large girth.
Thomassen
✭✭
0
Basic G.T.
fhavet
Switching reconstruction conjecture
Stanley
✭✭
0
fhavet
Switching reconstruction of digraphs
Bondy
;
Mercier
✭✭
0
fhavet
The Berge-Fulkerson conjecture
Berge
;
Fulkerson
✭✭✭✭
0
Basic G.T.
»
Matchings
mdevos
The Bermond-Thomassen Conjecture
Bermond
;
Thomassen
✭✭
0
Directed Graphs
JS
The Bollobás-Eldridge-Catlin Conjecture on graph packing
✭✭✭
0
Extremal G.T.
asp
The Borodin-Kostochka Conjecture
Borodin
;
Kostochka
✭✭
0
Andrew King
The circular embedding conjecture
Haggard
✭✭✭
0
Basic G.T.
»
Cycles
mdevos
« first
‹ previous
1
2
3
4
5
next ›
last »
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Algebraic G.T.
(8)
Basic G.T.
(39)
Coloring
(65)
Directed Graphs
(26)
Extremal G.T.
(9)
Graph Algorithms
(3)
Hypergraphs
(5)
Infinite Graphs
(11)
Probabilistic G.T.
(3)
Topological G.T.
(18)
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