Analytic methods for uniform hypergraphs
Preprint
Abstract
This paper develops analityc methods for investigating uniform hypergraphs. Its starting point is the spectral theory of 2-graphs, in particular, the largest and the smallest eigenvalues of 2-graphs. On the one hand, this simple setup is extended to weighted r-graphs, and on the other, the eigenvalues-numbers are generalized to eigenvalues-functions, which encompass also other graph parameters like Lagrangians and number of edges. The resulting theory is new even for 2-graphs, where well-settled topics become challenges again. The paper covers a multitude of topics, with more than a hundred concrete statements to underpin an analytic theory for hypergraphs. Essential among these topics are a Perron-Frobenius type theory and methods for extremal hypergraph problems. Many open problems are raised and directions for possible further research are outlined.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- On Spectral Hypergraph Theory of the Adjacency TensorGraphs and Combinatorics, 2013
- A spectral condition for odd cycles in graphsLinear Algebra and its Applications, 2008
- Regularity Lemma for k‐uniform hypergraphsRandom Structures & Algorithms, 2004
- On the second eigenvalue of hypergraphsCombinatorica, 1995
- Some graphs with small second eigenvalueCombinatorica, 1995
- Spectral Radius and Degree SequenceMathematische Nachrichten, 1988
- Spectral bounds for the clique and independence numbers of graphsJournal of Combinatorial Theory, Series B, 1986
- Lower bounds for the clique and the chromatic numbers of a graphDiscrete Applied Mathematics, 1983
- An inequality for the chromatic number of a graphJournal of Combinatorial Theory, 1968
- On extremal problems of graphs and generalized graphsIsrael Journal of Mathematics, 1964