Home » Keyword index

T-join


Graph Theory » Coloring » Edge coloring

Packing T-joins ★★

Author(s): DeVos

Conjecture   There exists a fixed constant $ c $ (probably $ c=1 $ suffices) so that every graft with minimum $ T $-cut size at least $ k $ contains a $ T $-join packing of size at least $ (2/3)k-c $.

Keywords: packing; T-join

Posted by mdevos
updated March 7th, 2007
add new comment
Syndicate content