Decomposing uniform hypergraphs into uniform hypertrees and single edges

DOI10.1016/J.DISC.2021.112454MaRDI QIDQ2032883zbMATH OpenOpenAlexFDO

Authors Zhenyu Ni, Erfang Shan, Liying Kang

Publication date 14 June 2021

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

decompositionhypergraphhypertree

Mathematics Subject Classification ID

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

Recommendations

• Decomposing hypergraphs into simple hypertrees
• Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs
• Decomposition of large combinatorial structures
• On decompositions of complete hypergraphs
• \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges

Cites work

• \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges
• \(H\)-decompositions of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly 2 edges
• An improved error term for minimum H-decompositions of graphs
• Decomposing hypergraphs into simple hypertrees
• Decomposition of graphs into (k,r)-fans and single edges
• Decomposition of graphs into cycles of length seven and single edges.
• Decompositions of graphs into 5-cycles and other small graphs
• Decompositions of graphs into fans and single edges
• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 6093217 (Why is no real title available?)
• scientific article; zbMATH DE number 4200236 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• Linear trees in uniform hypergraphs
• Minimum \(H\)-decompositions of graphs
• Minimum \(H\)-decompositions of graphs: edge-critical case
• On complete subgraphs of different orders
• The Representation of a Graph by Set Intersections
• Turán number and decomposition number of intersecting odd cycles

Cited in

(7)

• On decompositions of complete hypergraphs
• Decomposition of large combinatorial structures
• Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs
• Decomposing hypergraphs into simple hypertrees
• A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs
• \(H\)-decompositions of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly 2 edges
• Hypergraphs with polynomial representation: introducing \(r\)-splits

This page was built for publication: Decomposing uniform hypergraphs into uniform hypertrees and single edges

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