Counting matchings via capacity-preserving operators

DOI10.1017/S0963548321000122MaRDI QIDQ5886121

Leonid Gurvits, Jonathan Leake

Publication date: 30 March 2023

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.04351

zbMATH Keywords

capacity of a polynomial; capacity-preserving operators

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05A20: Combinatorial inequalities

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

26C10: Real polynomials: location of zeros

26D10: Inequalities involving derivatives and differential and integral operators