Spectral conditions for graphs having all (fractional) [a,b]-factors
Abstract
Let a≤ b be two positive integers. We say that a graph G has all [a,b]-factors if it has an h-factor for every function h: V(G)→ Z+ such that a h(v) b for all v∈ V(G) and Σv∈ V(G)h(v) 0 2, and has all fractional [a,b]-factors if it has a fractional p-factor for every p: V(G) → Z+ such that a p(v) b for all v∈ V(G). In this paper, we provide tight spectral radius conditions for graphs having all [a,b]-factors (3≤ a<b) and all fractional [a,b]-factors (1≤ a<b), respectively.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.