Decomposing uniform hypergraphs into uniform hypertrees and single edges

DOI10.1016/j.disc.2021.112454zbMath1466.05151OpenAlexW3160620128MaRDI QIDQ2032883

Erfang Shan, Zhenyu Ni, Li-ying 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

hypergraphdecompositionhypertree

Mathematics Subject Classification ID

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

Cites Work

• Minimum \(H\)-decompositions of graphs: edge-critical case
• An improved error term for minimum \(H\)-decompositions of graphs
• Decomposing hypergraphs into simple hypertrees
• \(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
• Minimum \(H\)-decompositions of graphs
• Turán number and decomposition number of intersecting odd cycles
• Linear trees in uniform hypergraphs
• Decompositions of graphs into 5-cycles and other small graphs
• On complete subgraphs of different orders
• Decomposition of Graphs into (k,r)‐Fans and Single Edges
• Decompositions of Graphs into Fans and Single Edges
• The Representation of a Graph by Set Intersections
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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