Papers
Topics
Authors
Recent
2000 character limit reached

Spectral conditions for graphs having all (fractional) $[a,b]$-factors (2212.03622v2)

Published 7 Dec 2022 in math.CO

Abstract: Let $a\leq 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)\rightarrow \mathbb{Z}+$ such that $a\le h(v) \le b$ for all $v\in V(G)$ and $\sum_{v\in V(G)}h(v)\equiv 0\pmod 2$, and has all fractional $[a,b]$-factors if it has a fractional $p$-factor for every $p: V(G) \rightarrow \mathbb{Z}+$ such that $a\le p(v)\le b$ for all $v\in V(G)$. In this paper, we provide tight spectral radius conditions for graphs having all $[a,b]$-factors ($3\leq a<b$) and all fractional $[a,b]$-factors ($1\leq a<b$), respectively.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.