Hypergraph polynomials and the Bernardi process

DOI10.5802/alco.129zbMath1448.05052arXiv1810.00812OpenAlexW3119440004MaRDI QIDQ2004047

Lilla Tóthmérész, Tamás Kálmán

Publication date: 14 October 2020

Published in: Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphbipartite graph\(h\)-vectorTutte polynomialdissectionroot polytoperibbon structureembedding activityinterior polynomialshelling order

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Root polytopes and Jaeger‐type dissections for directed graphs ⋮ \(h^*\) -vectors of graph polytopes using activities of dissecting spanning trees

Cites Work

• Unnamed Item
• A combinatorial model for the homfly polynomial
• A characterization of the Tutte polynomial via combinatorial embeddings
• Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings
• Normal polytopes arising from finite graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Root polytopes, parking functions, and the HOMFLY polynomial
• A version of Tutte's polynomial for hypergraphs
• Interior polynomial for signed bipartite graphs and the HOMFLY polynomial
• Permutohedra, Associahedra, and Beyond
• The Bernardi Process and Torsor Structures on Spanning Trees
• A lattice point counting generalisation of the Tutte polynomial
• Root polytopes, Tutte polynomials, and a duality theorem for bipartite graphs
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Hypergraph polynomials and the Bernardi process