English

On the independence number in subcubic graphs

Combinatorics 2025-09-11 v1

Abstract

For a connected subcubic graph GK1G\neq K_1 let Vi(G)={vV(G)  dG(v)=i}V_i(G) = \{v \in V(G) ~|~ d_G(v)=i\} for 1i3.1 \leq i \leq 3. Given c1,c2,c3R+c_1, c_2, c_ 3 \in \mathbb{R}^+ and dR d \in \mathbb{R}, we show several results of type α(G)c1V1(G)+c2V2(G)+c3V3(G)d.\alpha(G) \geq c_1|V_1(G)| + c_2|V_2(G)| + c_3|V_3(G)| - d. We also derive classes of graphs GG showing sharpness of these lower bounds on the independence number α(G)\alpha(G) of GG.

Keywords

Cite

@article{arxiv.2509.08367,
  title  = {On the independence number in subcubic graphs},
  author = {Jochen Harant and Ingo Schiermeyer},
  journal= {arXiv preprint arXiv:2509.08367},
  year   = {2025}
}
R2 v1 2026-07-01T05:29:41.626Z