Decomposing uniform hypergraphs into uniform hypertrees and single edges
type: Item
instance of: scholarly article
title: Decomposing uniform hypergraphs into uniform hypertrees and single edges
zbMATH Open document ID: 1466.05151
author: Zhenyu Ni
author: Erfang Shan
author: Liying Kang
published in: Discrete Mathematics
publication date: 2021-06-14T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7358451
zbMATH Keywords: hypergraph
zbMATH Keywords: hypertree
zbMATH Keywords: decomposition
MaRDI profile type: Publication
full work available at URL: j.disc.2021.112454
OpenAlex ID: W3160620128
cites work: An improved error term for minimum \(H\)-decompositions of graphs
cites work: Q4099676
cites work: On complete subgraphs of different orders
cites work: The Representation of a Graph by Set Intersections
cites work: Q3348932
cites work: Linear trees in uniform hypergraphs
cites work: \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges
cites work: Decomposition of Graphs into (k,r)‐Fans and Single Edges
cites work: Turán number and decomposition number of intersecting odd cycles
cites work: Q3089368
cites work: Decompositions of Graphs into Fans and Single Edges
cites work: Minimum \(H\)-decompositions of graphs: edge-critical case
cites work: Minimum \(H\)-decompositions of graphs
cites work: Decompositions of graphs into 5-cycles and other small graphs
cites work: \(H\)-decompositions of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly 2 edges
cites work: Q3166469
cites work: Decomposition of graphs into cycles of length seven and single edges.
cites work: Decomposing hypergraphs into simple hypertrees
DOI: 10.1016/J.DISC.2021.112454
description: scientific article; zbMATH DE number 7358451