Simplified existence theorems on all fractional [a,b]-factors

DOI10.1016/J.DAM.2013.02.006MaRDI QIDQ2446850zbMATH OpenOpenAlexFDO

Authors Hongliang Lu

Publication date 22 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1103.3983

zbMATH Keywords

all fractional factorsfractional factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: Let $G$ be a graph with order $n$ and let $g,f:V(G)ightarrowN$ such that $g(v)leqf(v)$ for all $vinV(G)$. We say that $G$ has all fractional $(g,f)$-factors if $G$ has a fractional $p$-factor for every $p:V(G)ightarrowN$ such that $g(v)leqp(v)leqf(v)$ for every $vinV(G)$. Let $a<b$ be two positive integers. %and $G$ extbf{a graph} of order $n$ sufficiently large %for $a$ and $b$. If $gequiva$, $fequivb$ and $G$ has all fractional $(g,f)$-factors, then we say that $G$ has all fractional $[a,b]$-factors. Suppose that $n$ is sufficiently large for $a$ and $b$. This paper contains two results on the existence of all $(g,f)$-factors of graphs. First, we derive from Anstee's fractional $(g,f)$-factor theorem a similar characterization for the property of all fractional $(g,f)$-factors. Second, we show that $G$ has all fractional $[a,b]$-factors if the minimum degree is at least $frac14a((a+b-1{)}^2+4b)$ and every pair of nonadjacent vertices has cardinality of the neighborhood union at least $bn/(a+b)$. These lower bounds are sharp.

Recommendations

• scientific article; zbMATH DE number 6902656
• Some existence theorems on all fractional (g,f)-factors with prescribed properties
• Simplified existence theorems for \((g,f)\)-factors
• Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
• A Fan-type result for the existence of restricted fractional \((g, f)\)-factors
• A simple existence criterion for \((g<f)\)-factors
• Some results on fractional \(k\)-factors
• All fractional \([a,b]\)-factors with prescribed properties.
• Neighborhood conditions for the existence of fractional k-factors with prescribed properties
• Fan-type results for the existence of [\(a\),\(b\)]-factors

Cites work

• A characterization of graphs having all (g,f)-factors
• Binding numbers and f-factors of graphs
• Simplified existence theorems for \((g,f)\)-factors
• Subgraphs with prescribed valencies

Cited in

(20)

• A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs
• Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs
• Some existence theorems on all fractional (g,f)-factors with prescribed properties
• Simplified existence theorems for \((g,f)\)-factors
• Discussion on fractional (a, b, k)-critical covered graphs
• Spectral radius and \([a,b]\)-factors in graphs
• Existence of all generalized fractional \((g, f)\)-factors of graphs
• Nash-Williams conditions for the existence of all fractional \([a,b]\)-factors
• Toughness condition for the existence of all fractional (a, b, k)-critical graphs
• Characterizations of graphs \(G\) having all \([1, k]\)-factors in \(k G\)
• On all fractional \({(a,b,k)}\)-critical graphs
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• A neighborhood condition for fractional ID-\([a,b]\)-factor-critical graphs
• The existence of all fractional \([a,b]\)-factors in networks
• scientific article; zbMATH DE number 6902656 (Why is no real title available?)
• All fractional \([a,b]\)-factors with prescribed properties.
• An improvement and generalization of all fractional factors in graphs
• Spectral conditions for graphs having all (fractional) $[a,b]$-factors
• Spectral radius, the matching number and fractional criticality of graphs
• Spectral extremal problem on all (a, b, k)-critical graphs

This page was built for publication: Simplified existence theorems on all fractional \([a,b]\)-factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446850)