A spectral inequality of Hoffman type is proved for weighted k-partite uniform r-hypergraphs when r is even and p ≥ r.
Hoffman, On eigenvalues and colorings of graphs, in Graph Theory and its Applica- tions, Academic Press, New York (1970), pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Hoffman's bound for hypergraphs
A spectral inequality of Hoffman type is proved for weighted k-partite uniform r-hypergraphs when r is even and p ≥ r.