A hypergraph Heilmann-Lieb theorem
From MaRDI portal
Cites work
- A proof of Alon’s second eigenvalue conjecture and related problems
- An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial
- An introduction to matching polynomials
- Eigenvalues and expanders
- Eigenvalues and linear quasirandom hypergraphs
- Eigenvalues of a real supersymmetric tensor
- Expander graphs and their applications
- Graph polynomials
- scientific article; zbMATH DE number 428989 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 568836 (Why is no real title available?)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Matching behaviour is asymptotically normal
- Matching theory
- Matchings and walks in graphs
- On a relationship between the characteristic and matching polynomials of a uniform hypertree
- On the adjacency spectra of hypertrees
- On the eigenvalues of trees
- On the first and second eigenvalue of finite and infinite uniform hypergraphs
- On the location of roots of graph polynomials
- On the second eigenvalue of hypergraphs
- On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
- On the theory of the matching polynomial
- Ramanujan coverings of graphs
- Ramanujan graphs
- Random matchings in regular graphs
- Spectra of uniform hypergraphs
- The characteristic polynomial of a graph
- The matching polynomials and spectral radii of uniform supertrees
- The Spectra of Infinite Hypertrees
- The spectra of uniform hypertrees
- The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
- Theory of monomer-dimer systems
This page was built for publication: A hypergraph Heilmann-Lieb theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6843299)
