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

DOI10.1016/J.DISC.2017.09.007MaRDI QIDQ1685990zbMATH OpenOpenAlexFDO

Authors Xiaofeng Gu, Hong-Jian Lai

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

partition connectivityspanning hypertreesuniformly dense

Mathematics Subject Classification ID

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

Recommendations

• A property on edge-disjoint spanning trees
• Asymptotic sharpness of bounds on hypertrees
• Decomposing hypergraphs into simple hypertrees
• On decomposing a hypergraph into \(k\) connected sub-hypergraphs
• Decomposing uniform hypergraphs into uniform hypertrees and single edges

Cites work

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

Cited in

(2)

• A property on edge-disjoint spanning trees
• Bounds on the number of edges of edge-minimal, edge-maximal and l-hypertrees

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

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