ON EIGENVALUES AND COLORINGS OF GRAPHS, II

@article{Hoffman1970ONEA,
  title={ON EIGENVALUES AND COLORINGS OF GRAPHS, II},
  author={Alan J. Hoffman and Leonard Howes},
  journal={Annals of the New York Academy of Sciences},
  year={1970},
  volume={175}
}
A. J. Hoffman, I . B . M . , Nev York* and Leonard Howes, The City University of N. Y. 1. I n t r o d u c t i o n . I n t h e l a s t s e c t i o n of a p rev ious paper w i t h t h e same t i t l e [l], s e v e r a l theorems r e l a t i n g t h e e igenva lues of t h e adjacency ma t r ix of a graph G t o t h e c o l o r i n g number and r e l a t e d f u n c t i o n s of G w e r e s t a t e d without proof . The purpose of t h e pres e n t paper is t o supply t h e p roof s of t hose… 
Intersecting Families , Independent Sets and Coloring of Certain Graph Products
We study analytical methods applied to combinatorial problems. Speci cally, we use techniques from Fourier analysis in order to understand certain combinatorial structures. One of the main ideas of
Ju n 20 21 THE TOUGHNESS OF KNESER GRAPHS
The toughness t(G) of a graph G is a measure of its connectivity that is closely related to Hamiltonicity. Xiaofeng Gu, confirming a longstanding conjecture of Brouwer, recently proved the lower
Buildings and Kneser graphs
If C is a collection of mutually intersecting k-subsets of a fixed n-set, how big can C be? And in the extreme case, what is the structure of C? This question was answered by Erd?os, Ko, and Rado,
Setwise intersecting families of permutations
  • David Ellis
  • Mathematics, Computer Science
    J. Comb. Theory, Ser. A
  • 2012
A ug 2 00 6 Graph powers , Delsarte , Hoffman , Ramsey and Shannon
The k-th p-power of a graph G is the graph on the vertex set V (G), where two k-tuples are adjacent iff the number of their coordinates which are adjacent in G is not congruent to 0 modulo p. The
Graph powers , Delsarte , Hoffman , Ramsey and Shannon Noga Alon
The k-th p-power of a graph G is the graph on the vertex set V (G), where two k-tuples are adjacent iff the number of their coordinates which are adjacent in G is not congruent to 0 modulo p. The
C O ] 1 8 A ug 2 02 0 THE TOUGHNESS OF KNESER GRAPHS
The toughness t(G) of a graph G is a measure of its connectivity that is closely related to Hamiltonicity. Brouwer proved the lower bound t(G) > l/λ−2 on the toughness of any connected l-regular
The edge density of critical digraphs
TLDR
This note analyzes the edge density problem for directed graphs, where the chromatic number χ(D) of a digraph D is defined to be the fewest number of colours needed to colour the vertices of D so that each colour class induces an acyclic subgraph.
Graph Powers, Delsarte, Hoffman, Ramsey, and Shannon
TLDR
It is proved that the larger the Shannon capacity of $\overline{G}$ is, the larger these subgraphs are, and if $G$ is the complete graph, then some p-power of G matches the bounds of the Frankl-Wilson Ramsey construction, and is in fact a subgraph of a variant of that construction.
...
1
2
3
4
5
...

References

SHOWING 1-5 OF 5 REFERENCES
On subdominantly bounded graphs", Doctoral D i s s e r t a t i o n
  • 1970