Fan-type results for the existence of [a,b]-factors

DOI10.1016/J.DISC.2006.01.018MaRDI QIDQ2488945zbMATH OpenOpenAlexFDO

Authors Haruhide Matsuda

Publication date 16 May 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.01.018

zbMATH Keywords

neighborhood union

Mathematics Subject Classification ID

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

Review text

Let \(1\leq a<b\) be integers and \(G\) a graph of order \(n\) sufficiently large for \(a\) and \(b\). Then \(G\) has an \([a,b]\)-factor if the minimum degree is at least \(a\) and every pair of vertices distance two apart has cardinality of the neighborhood union at least \(an/(a+b)\). This lower bound is sharp. As a consequence, we have a Fan-type condition for a graph to have an \([a,b]\)-factor.

Recommendations

• A Fan-type condition for the existence of \([a,b]\)-factors
• A neighbourhood condition for graphs to have \([a,b]\)-factors
• Two results on the existence of \([a,b]\)-factors in graphs
• scientific article; zbMATH DE number 1501177
• A neighborhood condition for graphs to have \([a, b]\)-factors. II

Cites work

• A neighbourhood condition for graphs to have \([a,b]\)-factors
• scientific article; zbMATH DE number 1117461 (Why is no real title available?)
• scientific article; zbMATH DE number 1409219 (Why is no real title available?)
• New sufficient conditions for cycles in graphs
• Subgraphs with prescribed valencies

Cited in

(21)

• Simplified existence theorems for \((g,f)\)-factors
• Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers
• Simplified existence theorems on all fractional \([a,b]\)-factors
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• A Fan-type condition for the existence of \([a,b]\)-factors
• Binding number and minimum degree for fractional (k,m)-deleted graphs
• A sufficient condition for a graph to be a fractional \((f,n)\)-critical graph
• Neighbourhood and the existence of fractional k-factors of graphs
• A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs
• Neighbourhood conditions for fractional ID-\([a,b]\)-factor-critical graphs
• Some sufficient conditions for graphs to have (g, f)-factors
• Notes on the binding numbers for (a, b, k)-critical graphs
• Sufficient conditions for graphs to have strong parity factors
• Binding numbers and \([a,b]\)-factors excluding a given \(k\)-factor
• A spectral condition for a graph to have strong parity factors
• Characterizing spanning trees via the size or the spectral radius of graphs
• Signless Laplacian spectral conditions for \(k\)-critical graphs with respect to \([1, b]\)-odd factors
• Some results on the k-strong parity property in a graph
• Spanning subgraphs and spectral radius in graphs
• Laplacian eigenvalue condition for a graph to have the strong parity property
• Sufficient conditions for a graph with minimum degree to be \(k\)-critical with respect to an odd \([1,b]\)-factor

This page was built for publication: Fan-type results for the existence of [\(a\),\(b\)]-factors

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