{'fraction_non_alphanumeric': 0.04968575833036879, 'fraction_numerical': 0.016601446697497926, 'mean_word_length': 3.677759290072102, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 5, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Hoffman's ratio bound

Hoffman's ratio bound is an upper bound for the independence number of a regular graph in terms of the eigenvalues of the adjacency matrix. The bound has proved to be very useful and has been applied many times. Hoffman did not publish his result, and for a great number of users the emergence of Hoffman's bound is a black hole. With this note I hope to clarify the history of this bound and some of its generalizations.


Introduction
Although Hoffman didn't publish his bound, it is perhaps his most cited result. He communicated his bound with Jaap Seidel, who then called it the Hoffman bound (later Chris Godsil used 'ratio bound' so 'Hoffman's ratio bound' seems to be a good compromise). I was a student of Jaap Seidel in the seventies, and Jaap told me the story of the bound. In later years, I noticed that many authors had problems with the correct reference. I have seen references to Delsarte [1], Lovász [7] and to the wrong paper of Hoffman [6]. Thus, I thought that it may be a good idea to write my memories of Hoffman's bound and devote them to his memory.

The bound
Throughout G is a simple graph of order n, having adjacency matrix A with eigenvalues λ 1 ≥ · · · ≥ λ n . A subset of the vertex set of G with no edges is a coclique or independent set. The maximum size of an independent set in G is the independence number, denoted by α.
Proof. Since G is regular, A1 = k1 (1 is the all-ones vector). In fact, k = λ 1 by the Perron-Frobenius theorem. So A and the n × n all-ones matrix J n have a common basis of eigenvectors, consisting of 1 and n − 1 vectors orthogonal to 1. This implies that the smallest eigenvalue of A − k−λn n J n equals λ n , and hence E = A − k−λn n J n − λ n I n is positive semi-definite. Since G has a coclique of order α, the α × α matrix E α = − k−λn n J α − λ n I α is a principal submatrix of E. Therefore, E α is positive semi-definite, which implies −λ n − α(k − λ n )/n ≥ 0, hence α ≤ −λ n n/(k − λ n ).

History
The story starts with Philippe Delsarte. In 1973 he published his influential PhD thesis [1] entitled 'An algebraic approach to the association schemes of coding theory'. An important result in [1] is the so-called linear programming bound for subsets in an association scheme. As an example of this linear programming bound Delsarte derives the following upper bound for ω, the maximum order of a clique in a strongly regular graph G (formula (3.22) in [1]): A clique in G is a coclique in the complement of G, and for a strongly regular graph the complement is also strongly regular and has degree n − k − 1 and smallest eigenvalue −λ 2 − 1. Therefore α ≤ 1 + (n − k − 1)/(λ 2 + 1). The eigenvalues of a strongly regular graph satisfy (k − λ 2 )(k − λ n ) = (k + λ 2 λ n )n. By use of this identity it follows that the latter inequality is Hoffman's bound (1). Thus, if applied to a strongly regular graph, Delsarte [1] is the right reference for (1). The above derivation can be a bit cumbersome, and it may come as a surprise that the final formula is as simple as Hoffman's bound. But in fact, there is a reason. A strongly regular graph is a special case of a graph in an association scheme and Delsarte has proved that for such graph the product of the linear programming bounds for a clique and a coclique is at most n. Therefore α ≤ n/(1 − k/λ n ).
Jaap Seidel was a good friend and close collaborator of Jean-Marie Goethals, who was the supervisor of Delsarte. So Jaap knew Delsarte and his work very well and he liked the bounds for a clique and coclique in a strongly regular graph. At some conference in which Jaap Seidel and Alan Hoffman both participated (I don't remember if Jaap mentioned to me which conference it was; perhaps it was the NATO meeting on Combinatorics which took place at Nijenrode castle in Breukelen, The Netherlands, in 1974), Jaap and Alan were sitting together talking mathematics. Jaap told Alan about Delsarte's result. Then, a little later Alan replied that he could prove that the coclique bound is valid for arbitrary regular graphs, and moreover, that it would give a short proof for his lower bound on the chromatic number χ (χ ≥ 1 − λ 1 /λ n ; see [6]) in case the graph is regular. Indeed, in a vertex coloring each color class has maximum size at most α, so the number of color classes is at least n/α ≥ 1 − k/λ n . In 1975, Jaap told me the story and he wondered if the Hoffman bound could be generalized to arbitrary graphs. It was the starting point of my PhD research.
In 1979 László Lavász published his famous paper 'On the Shannon capacity of a graph' [7]. In that paper Lovász introduced the graph parameter ϑ (now known as 'Lovász's theta') and proved that ϑ is an upper bound for the Shannon capacity Θ, a measure from information theory. In [7, Theorem 9] Lovász states that ϑ ≤ −nλ n /(k − λ n ). By definition Θ is bounded from below by the independence number α. Therefore Lovász' Theorem 9 implies Hoffman's bound. Lovász was aware of this and mentioned it in the acknowledgements. However, he gives Hoffman too much credit and attributes Theorem 9 to him.
It is interesting that Hoffman was very close to proving that his bound is also an upper bound for the Shannon capacity. It follows easily from the proof of Theorem 1 that the Hoffman bound remains valid for a weighted adjacency matrix A, as long as all row (and column) sums are equal to k. Using this observation it takes just a few steps to prove that Θ ≤ −λ n n/(k − λ n ), as is illustrated in Theorem 3.4 of [5].
Because ϑ is defined for an arbitrary graph, ϑ can be seen as a generalization of Hoffman's bound to arbitrary graphs. However, the definition of ϑ is involved and what Jaap wanted was an easy formula in terms of the eigenvalues of the adjacency matrix.

Interlacing eigenvalues
The generalization that Jaap had in mind appeared in my PhD thesis [4], where I used eigenvalue interlacing to obtain a number of Hoffman-type inequalities. An announcement of the results appeared in [3] in 1978, and this paper is perhaps the earliest paper that mentions Hoffman's bound. Below is a simplified illustration of this approach.
We apply Theorem 2 to the adjacency matrix A of G. Suppose A 1,1 corresponds to a coclique C in G of order α. Then A 1,1 = O, b 1,1 = 0, α b 1,2 = b 2,1 (n − α) and therefore det B = −α b 2 1,2 /(n − α). On the other hand, Theo- Hence α ≤ −nλ 1 λ n /(b 2 1,2 −λ 1 λ n ). If δ is the minimum degree in G then b 1,2 ≥ δ, and therefore: If G is regular of degree k, then k = λ 1 = δ, so in this case (3) reduces to Hoffman's ratio bound. If equality holds in (3), then µ 1 = λ 1 and µ 2 = λ n , so Theorem 2(ii) gives that each vertex of G has a constant number of neighbors inside C, and a constant number of neighbors outside C. Clearly these constants are the entries of B. In particular, in case G is regular we find that equality in the Hoffman bound implies that each vertex outside C has exactly αk/(n − α) = −λ n neighbors in C.
If A 1,1 corresponds to an arbitrary induced subgraph of G something similar can be done, and if G is regular of degree k, the formula becomes rather neat. Then k = λ 1 = µ 1 , and Theorem 2 gives λ 2 ≥ µ 2 ≥ λ n which leads to where m is the order, and ℓ is the average degree of the induced subgraph corresponding to A 1,1 . If ℓ = 0, the right hand side gives Hoffman's bound, and if ℓ = m − 1 the left hand side gives m ≤ n(λ 2 + 1)/(λ 2 + n − k), which is Hoffman's bound applied to the complement of G.
Much later Godsil and Newman [2, Corollary 3.6] generalized Hoffman's bound to arbitrary graphs in terms of the eigenvalues of the Laplacian matrix L defined by L = D − A, where D is the diagonal matrix with the vertex degrees. Also for this case interlacing works. We apply Theorem 2 with L instead of A, such that L 1,1 corresponds to a coclique C of order α. Then L 1,1 is a diagonal matrix with the degrees of the vertices in C on the diagonal. This implies that b 1,1 , the average row sum of L 1,1 , is at least the minimum degree δ. From L1 = 0, it follows that B1 = 0, which implies that µ 2 = 0, µ 1 = trace B = b 1,1 + b 2,2 and b 2,2 = α b 1,1 /(n − α). Let ϕ be the largest eigenvalue of L, then Theorem 2(i) gives µ 1 ≤ ϕ, and therefore: α ≤ n(1 − δ/ϕ).
If equality holds, we get the same conclusion as for equality in (3). If G is regular of degree k, then δ = k and ϕ = k − λ n , and again we obtain Hoffman's ratio bound.