Hitting Maximum Independent Sets in Dense and Highly Connected Graphs

Abstract

For a graph $G$, let $h(G)$ be the minimum cardinality of a vertex set meeting every maximum independent set of $G$. We establish two complementary reduction principles for the Bollobás--Erdős--Tuza conjecture: the conjecture for arbitrary graphs is equivalent to its restriction to regular graphs of any fixed positive linear degree, and, within every hereditary graph class, a uniform sublinear bound is equivalent to a sublinear bound on graphs of every fixed positive linear vertex connectivity. We prove the sharp general estimate \[ h(G)\le \left\lfloor\frac{|V(G)|}{2α(G)+δ(G)-|V(G)|}\right\rfloor \] whenever the denominator is positive, with equality for balanced complete multipartite graphs. Consequently, every $3$-colorable graph of order $n$ with $\kappa (G)\ge \rho n$ and $\rho >1/3$ has a hitting set of size at most $\lfloor (\rho -1/3{)}^{-1}\rfloor$; direct use of a $3$-coloring improves this to $6$ when $\kappa (G)>4n/9$ and to the sharp bound $3$ when $\kappa (G)>n/2$. For dense regular graphs with independence ratio greater than $1/4$, we obtain a logarithmic bound, while constructions with linear degree and linear independence number show that $h(G)=\Omega (\sqrt{n})$ can still occur. We also prove a logarithmic bound for near-regular $3$-colorable graphs and exhibit a critical family at connectivity $n/3$ that explains the limitations of the degree-surplus and degree-ratio methods.

The main theorem is wrong