Multicovering hypergraphs

DOI10.1016/J.DISC.2021.112386MaRDI QIDQ2022167zbMATH OpenOpenAlexFDO

Authors Anand Babu, Sundar Vishwanathan

Publication date 28 April 2021

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Graham-Pollak theoremhypergraphmulticovering

Mathematics Subject Classification ID

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

Recommendations

• Bounds for the Graham-Pollak theorem for hypergraphs
• Coverings of r—graphs by complete r—partite subgraphs
• Decomposition of the complete r-graph into complete r-partite r-graphs
• Improved bounds for the Graham-Pollak problem for hypergraphs
• Decomposing the complete \(r\)-graph

Cites work

• A counterexample to the Alon-Saks-Seymour conjecture and related problems
• A counting proof of the Graham-Pollak theorem
• A new proof of a theorem of Graham and Pollak
• A polynomial space proof of the Graham-Pollak theorem
• Bounds for the Graham-Pollak theorem for hypergraphs
• Decomposing the complete \(r\)-graph
• Decomposition of the complete r-graph into complete r-partite r-graphs
• Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
• Distance matrix polynomials of trees
• scientific article; zbMATH DE number 426159 (Why is no real title available?)
• scientific article; zbMATH DE number 3395950 (Why is no real title available?)
• scientific article; zbMATH DE number 970791 (Why is no real title available?)
• Improved bounds for the Graham-Pollak problem for hypergraphs
• On decompositions of complete hypergraphs
• On the Addressing Problem for Loop Switching
• On the decomposition ofkn into complete bipartite graphs
• Variations on a theme of Graham and Pollak

Cited in

(20)

• Efficient covering designs of the complete graph
• On a problem of Erdős and Moser
• Improved bounds for the Graham-Pollak problem for hypergraphs
• Decomposition of the complete r-graph into complete r-partite r-graphs
• Covering the edges of a random hypergraph by cliques
• Bipartite Hansel results for hypergraphs
• Bounds for the Graham-Pollak theorem for hypergraphs
• Partial covering of hypergraphs
• On extending Hansel's theorem to hypergraphs
• scientific article; zbMATH DE number 426361 (Why is no real title available?)
• scientific article; zbMATH DE number 3887743 (Why is no real title available?)
• Equicovering subgraphs of graphs and hypergraphs
• Coverings of r—graphs by complete r—partite subgraphs
• scientific article; zbMATH DE number 908096 (Why is no real title available?)
• Erdős-Pyber theorem for hypergraphs and secret sharing
• Trinque problem: covering complete graphs by plane degree-bounded hypergraphs
• Perfect multiple coverings of a hypercube
• Covering complete hypergraphs with cuts of minimum total size
• Covering numbers of regular multigraphs
• Covering the complete graph by partitions

This page was built for publication: Multicovering hypergraphs

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