Home » Keyword index

matching cut, matching, cut


Graph Theory

Matching cut and girth ★★

Author(s):

Question   For every $ d $ does there exists a $ g $ such that every graph with average degree smaller than $ d $ and girth at least $ g $ has a matching-cut?

Keywords: matching cut, matching, cut

Posted by w
updated November 30th, 2011
add new comment
Syndicate content