Open Problem Garden
Help
About
Contact
login/create account
Home
»
Keyword index
T-join
Graph Theory
»
Coloring
»
Edge coloring
Packing T-joins
★★
Author(s):
DeVos
Conjecture
There exists a fixed constant
(probably
suffices) so that every graft with minimum
-cut size at least
contains a
-join packing of size at least
.
Keywords:
packing
;
T-join
Posted by
mdevos
updated March 7th, 2007
add new comment
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