Extremal problems on $[a,b]$-covered graphs

Qixuan Yuan, Ruifang Liu, Jinjiang Yuan

A graph $G$ is $[a,b]$-covered if for each edge $e$ of $G$ there is an $[a,b]$-factor containing it. For $a=b=1$, an $[a,b]$-covered graph is a matching covered graph. The structur…