Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Topic » Subtopic
Posted by
The Crossing Number of the Complete Bipartite Graph
Turan
✭✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
The Crossing Number of the Complete Graph
✭✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
The Crossing Number of the Hypercube
Erdos
;
Guy
✭✭
0
Topological G.T.
»
Crossing numbers
Robert Samal
The Erdös-Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Extremal G.T.
mdevos
The intersection of two perfect matchings
Macajova
;
Skoviera
✭✭
0
Basic G.T.
»
Matchings
mdevos
The stubborn list partition problem
Cameron
;
Eschen
;
Hoang
;
Sritharan
✭✭
0
Graph Algorithms
mdevos
The three 4-flows conjecture
DeVos
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
The Two Color Conjecture
Neumann-Lara
✭✭
0
Directed Graphs
mdevos
Three-chromatic (0,2)-graphs
Payan
✭✭
0
Coloring
Gordon Royle
Total Colouring Conjecture
Behzad
✭✭✭
0
Coloring
Iradmusa
Triangle free strongly regular graphs
✭✭✭
0
Algebraic G.T.
mdevos
Triangle-packing vs triangle edge-transversal.
Tuza
✭✭
0
Extremal G.T.
fhavet
Turán number of a finite family.
Erdos
;
Simonovits
✭✭
0
fhavet
Turán's problem for hypergraphs
Turan
✭✭
0
Hypergraphs
fhavet
Unfriendly partitions
Cowan
;
Emerson
✭✭✭
0
Infinite Graphs
mdevos
Unions of triangle free graphs
Erdos
;
Hajnal
✭✭✭
0
Infinite Graphs
mdevos
Unit vector flows
Jain
✭✭
0
Coloring
»
Nowhere-zero flows
mdevos
Universal highly arc transitive digraphs
Cameron
;
Praeger
;
Wormald
✭✭✭
0
Infinite Graphs
mdevos
Universal point sets for planar graphs
Mohar
✭✭✭
0
Topological G.T.
»
Drawings
mdevos
Universal Steiner triple systems
Grannell
;
Griggs
;
Knor
;
Skoviera
✭✭
0
Coloring
»
Edge coloring
macajova
Vertex Coloring of graph fractional powers
Iradmusa
✭✭✭
1
Iradmusa
Weak pentagon problem
Samal
✭✭
0
Coloring
»
Homomorphisms
Robert Samal
Weak saturation of the cube in the clique
Morrison
;
Noel
✭
1
Extremal G.T.
Jon Noel
Weighted colouring of hexagonal graphs.
McDiarmid
;
Reed
✭✭
0
Coloring
»
Vertex coloring
fhavet
What is the largest graph of positive curvature?
DeVos
;
Mohar
✭
1
Topological G.T.
»
Planar graphs
mdevos
What is the smallest number of disjoint spanning trees made a graph Hamiltonian
Goldengorin
✭✭
0
Extremal G.T.
boris
Woodall's Conjecture
Woodall
✭✭✭
0
Directed Graphs
mdevos
¿Are critical k-forests tight?
Strausz
✭✭
0
Hypergraphs
Dino
« first
‹ previous
1
2
3
4
5
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