A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs

DOI10.1016/j.disc.2017.09.007zbMath1376.05103OpenAlexW2763658863MaRDI QIDQ1685990

Hong-Jian Lai, Xiaofeng Gu

Publication date: 20 December 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2017.09.007

zbMATH Keywords

uniformly densespanning hypertreespartition connectivity

Mathematics Subject Classification ID

Trees (05C05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Cites Work

• Augmenting and preserving partition connectivity of a hypergraph
• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• A property on edge-disjoint spanning trees
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs