scientific article; zbMATH DE number 3747179
From MaRDI portal
Publication:3933016
Cited in
(38)- Ramanujan coverings of graphs
- Interlacing families and the Hermitian spectral norm of digraphs
- On immanants of Jacobi-Trudi matrices and permutations with restricted position
- An analysis of Monte Carlo algorithm for estimating the permanent
- Concentration of permanent estimators for certain large matrices.
- On the largest eigenvalue of a mixed graph with partial orientation
- On the matching and permanental polynomials of graphs
- On the unimodality of average edge cover polynomials
- The average Laplacian polynomial of a graph
- Spectrahedrality of hyperbolicity cones of multivariate matching polynomials
- Noncommutativity makes determinants hard
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- A general law of large permanent
- An algorithm for calculating the independence and vertex-cover polynomials of a graph
- On a conjecture of Wilf
- Lower matching conjecture, and a new proof of Schrijver's and Gurvits's theorems
- A load balancing strategy for parallel computation of sparse permanents.
- A new expression for matching polynomials
- The characteristic polynomial and the matchings polynomial of a weighted oriented graph
- Approximating the permanent: A simple approach
- Signatures, lifts, and eigenvalues of graphs
- Open problems in the spectral theory of signed graphs
- Non-commutative circuits and the sum-of-squares problem
- Clifford algebras and approximating the permanent
- The matching polynomials of hypergraphs and weighted hypergraphs
- Spectra of power hypergraphs and signed graphs via parity-closed walks
- The algebraic multiplicity of the spectral radius of a uniform hypertree
- Determinants of Seidel tournament matrices
- On integral variations for roots of the Laplacian matching polynomial of graphs
- Matching polynomials of regular chain-type graphs
- Some identities for the Chebyshev polynomials using graph matchings
- On the degeneracy of spin ice graphs, and its estimate via the Bethe permanent
- An efficient algorithm for computing permanental polynomials of graphs
- Hoffman program of Laplacian matching polynomials of graphs
- Eigenvalues of universal covers and the matching polynomial
- Counting with two-level polynomials
- Random path method with pivoting for computing permanents of matrices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3933016)
