Open Problem Garden
Help
About
Contact
login/create account
Home
»
Subject
»
Graph Theory
Extremal Graph Theory
Title
Author(s)
Imp.¹
Rec.²
Subtopic
Posted by
The Erdös-Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
mdevos
What is the smallest number of disjoint spanning trees made a graph Hamiltonian
Goldengorin
✭✭
0
boris
Extremal problem on the number of tree endomorphism
Zhicong Lin
✭✭
1
shudeshijie
Complexity of the H-factor problem.
Kühn
;
Osthus
✭✭
0
fhavet
Odd-cycle transversal in triangle-free graphs
Erdos
;
Faudree
;
Pach
;
Spencer
✭✭
0
fhavet
Triangle-packing vs triangle edge-transversal.
Tuza
✭✭
0
fhavet
The Bollobás-Eldridge-Catlin Conjecture on graph packing
✭✭✭
0
asp
Weak saturation of the cube in the clique
Morrison
;
Noel
✭
1
Jon Noel
Multicolour Erdős--Hajnal Conjecture
Erdos
;
Hajnal
✭✭✭
0
Jon Noel
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
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
Partition of Complete Geometric Graph into Plane Trees
Smooth 4-dimensional Poincare conjecture
more