Multicovering hypergraphs
type: Item
instance of: scholarly article
title: Multicovering hypergraphs
zbMATH Open document ID: 1462.05263
author: Anand Babu
author: Sundar Vishwanathan
published in: Discrete Mathematics
publication date: 2021-04-28T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7340600
zbMATH Keywords: hypergraph
zbMATH Keywords: Graham-Pollak theorem
zbMATH Keywords: multicovering
MaRDI profile type: Publication
full work available at URL: j.disc.2021.112386
OpenAlex ID: W4206115989
cites work: Decomposition of the complete r-graph into complete r-partite r-graphs
cites work: Q5688995
cites work: Bounds for the Graham-Pollak theorem for hypergraphs
cites work: Q3136986
cites work: On decompositions of complete hypergraphs
cites work: Variations on a theme of Graham and Pollak
cites work: Distance matrix polynomials of trees
cites work: On the Addressing Problem for Loop Switching
cites work: Q5663904
cites work: A counterexample to the Alon-Saks-Seymour conjecture and related problems
cites work: Decomposing the complete \(r\)-graph
cites work: Improved bounds for the Graham-Pollak problem for hypergraphs
cites work: A new proof of a theorem of Graham and Pollak
cites work: Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
cites work: On the decomposition ofkn into complete bipartite graphs
cites work: A polynomial space proof of the Graham-Pollak theorem
cites work: A counting proof of the Graham-Pollak theorem
DOI: 10.1016/J.DISC.2021.112386
description: scientific article; zbMATH DE number 7340600