Some existence theorems on all fractional (g,f)-factors with prescribed properties
Abstract
Let G be a graph, and g,f:V(G)→ Z+ with g(x)≤ f(x) for each x∈ V(G). We say that G admits all fractional (g,f)-factors if G contains a fractional r-factor for every r:V(G)→ Z+ with g(x)≤ r(x)≤ f(x) for any x∈ V(G). Let H be a subgraph of G. We say that G has all fractional (g,f)-factors excluding H if for every r:V(G)→ Z+ with g(x)≤ r(x)≤ f(x) for all x∈ V(G), G has a fractional r-factor Fh such that E(H) E(Fh)=, where h:E(G)→ [0,1] is a function. In this paper, we show a characterization for the existence of all fractional (g,f)-factors excluding H and obtain two sufficient conditions for a graph to have all fractional (g,f)-factors excluding H.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.