Multicovering hypergraphs
From MaRDI portal
Publication:2022167
DOI10.1016/j.disc.2021.112386zbMath1462.05263OpenAlexW4206115989MaRDI QIDQ2022167
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
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A counterexample to the Alon-Saks-Seymour conjecture and related problems
- A new proof of a theorem of Graham and Pollak
- On decompositions of complete hypergraphs
- Distance matrix polynomials of trees
- Decomposing the complete \(r\)-graph
- Improved bounds for the Graham-Pollak problem for hypergraphs
- Decomposition of the complete r-graph into complete r-partite r-graphs
- Variations on a theme of Graham and Pollak
- A counting proof of the Graham-Pollak theorem
- Bounds for the Graham-Pollak theorem for hypergraphs
- A polynomial space proof of the Graham-Pollak theorem
- On the decomposition ofkn into complete bipartite graphs
- Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem
- On the Addressing Problem for Loop Switching
This page was built for publication: Multicovering hypergraphs
