Generating functions and counting formulas for spanning trees and forests in hypergraphs

DOI10.1016/J.AAM.2023.102667MaRDI QIDQ6153615zbMATH OpenOpenAlexFDO

Authors Jiuqiang Liu, Shenggui Zhang, Guihai Yu

Publication date 14 February 2024

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aam.2023.102667

zbMATH Keywords

Berezin-Grassmann integralHafnianshypergraphsmatrix tree theoremPfaffiansspanning forestsspanning trees

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Trees (05C05) Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65)

Recommendations

• Grassmann integral representation for spanning hyperforests
• Hyperforests on the complete hypergraph by Grassmann integral representation
• scientific article; zbMATH DE number 1786671
• Note on the Pfaffian matrix-tree theorem
• Spanning trees of 3-uniform hypergraphs

Cites work

• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions
• Hafnians, perfect matchings and Gaussian matrices
• scientific article; zbMATH DE number 3508526 (Why is no real title available?)
• scientific article; zbMATH DE number 976341 (Why is no real title available?)
• scientific article; zbMATH DE number 1786671 (Why is no real title available?)
• scientific article; zbMATH DE number 3047763 (Why is no real title available?)
• Hypergraphs and a functional equation of Bouwkamp and de Bruijn
• Matrix tree theorems
• Matrix-tree theorems and discrete path integration
• Matroid matching and some applications
• Milnor numbers, spanning trees, and the Alexander-Conway polynomial.
• New algorithms for linear \(k\)-matroid intersection and matroid \(k\)-parity problems
• Nonintersecting paths, pfaffians, and plane partitions
• Pfaffian and Hafnian identities in shuffle algebras
• Quantum permanents and Hafnians via Pfaffians
• The Grassmann-Berezin calculus and theorems of the matrix-tree type
• The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
• Zeon algebra and combinatorial identities

Cited in

(1)

• Spanning hypertrees, vertex tours and meanders

This page was built for publication: Generating functions and counting formulas for spanning trees and forests in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153615)