Document Type
Lecture
Publication Date
9-26-2014
Abstract
This talk will present an analytic approach for studying hypergraphs. The roots of the method are in the spectral theory for 2-graphs and in the theory of variational spectra of hypermatrices. The basic concepts of the method give a single viewpoint to a number of problems in hypergraphs, erasing the dierences between spectral and nonspectral results. The approach is particularly appropriate for extremal problems; for example it allows to prove that spectral extremal problems for hypergraphs are asymptotically equivalent to the corresponding edge extremal problems. This talk is not too technical and it should be interesting for a wider audience.
Relational Format
presentation
Recommended Citation
Nikiforov, Vladimir, "Some analytic methods for hypergraphs" (2014). Combinatorics Seminar. 49.
https://egrove.olemiss.edu/math_combinatorics/49
