The optimal bound on the 3-independence number obtainable from a polynomial-type method

TL;DR

This paper establishes the best possible spectral bound for the 3-independence number in graphs using polynomial methods, improving understanding of graph independence in spectral graph theory.

Contribution

It derives the optimal polynomial-based bound for the 3-independence number, extending spectral bounds beyond cases k=1,2.

Findings

Provides the tightest spectral bound for 3-independence number

Applies the bound to Hamming graphs and other families

Enhances polynomial methods in spectral graph theory

Abstract

A $k$-independent set in a connected graph is a set of vertices such that any two vertices in the set are at distance greater than $k$ in the graph. The $k$-independence number of a graph, denoted $\alpha_k$, is the size of a largest $k$-independent set in the graph. Recent results have made use of polynomials that depend on the spectrum of the graph to bound the $k$-independence number. They are optimized for the cases $k=1,2$. There are polynomials that give good (and sometimes) optimal results for general $k$, including case $k=3$. In this paper, we provide the best possible bound that can be obtained by choosing a polynomial for case $k=3$ and apply this bound to well-known families of graphs including the Hamming graph.