Modulus of hypertrees

DOI10.1016/J.DAM.2026.07.033MaRDI QIDQ7353755zbMATH OpenFDO

Authors Huy Truong, Pietro Poggi-Corradini

Publication date 18 September 2026

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

Full work available at URL https://doi.org/10.1016/J.DAM.2026.07.033

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Cites work

• A generalization of Kónig's theorem
• Blocking and anti-blocking pairs of polyhedra
• Blocking duality for \(p\)-modulus on networks and applications
• Connection and separation in hypergraphs
• Decomposition of Finite Graphs Into Forests
• Edge-Disjoint Spanning Trees of Finite Graphs
• Fairest edge usage and minimum expected overlap for random spanning trees
• scientific article; zbMATH DE number 3512137 (Why is no real title available?)
• scientific article; zbMATH DE number 3345048 (Why is no real title available?)
• Minimal subfamilies and the probabilistic interpretation for modulus on graphs
• Modulus for bases of matroids
• Modulus on graphs as a generalization of standard graph theoretic quantities
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• On some algorithmic aspects of hypergraphic matroids
• On the Problem of Decomposing a Graph into n Connected Factors
• On the spanning tree polyhedron
• Spanning tree modulus for secure broadcast games
• Uniform density in matroids, matrices and graphs

This page was built for publication: Modulus of hypertrees

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