# matching cut, matching, cut

## Matching cut and girth ★★

Author(s):

\begin{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? \end{question}

Keywords: matching cut, matching, cut