The extremal edge count and spectral radius for graphs and bipartite graphs with no [a,b]-factor are determined exactly, with all extremal graphs characterized.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Tur\'an-type problems on $[a,b]$-factors of graphs, and beyond
The extremal edge count and spectral radius for graphs and bipartite graphs with no [a,b]-factor are determined exactly, with all extremal graphs characterized.