An existence theorem on fractional deleted graphs (Q343264): Difference between revisions

Let \(G\) be a graph with vertex set \(V(G)\) and edge set \(E(G)\). For two integer-valued functions \(f\) and \(g\) defined on \(V(G)\) satisfying \(0 \leq g(x) \leq f(x)\) for any \(x \in V(G)\), a fractional \((g,f)\)-factor is a function \(h\) that assigns to each edge of \(G\) a number in \([0,1]\). If \(d^h_G(x)=\sum_{e \in E(G)} h(e)\) is the fractional degree of \(x\) in \(G\), then, for each \(x \in V(G)\), we have \(g(x) \leq d^h_G(x) \leq f(x)\). A graph \(G\) is called a fractional \((g,f)\)-deleted graph if \(G-e\) has a fractional \((g,f)\)-factor for each \(e \in E(G)\). The authors establish a degree condition for the existence of fractional \((g,f)\)-deleted graphs.