Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs

DOI10.1017/S096354831100006XzbMath1223.05226MaRDI QIDQ5199506

André Kündgen, Sebastian M. Cioabă, Craig Timmons, Vladislav V. Vysotsky

Publication date: 16 August 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

probability problemnatural polyhedral problem

Mathematics Subject Classification ID

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

Related Items (2)

On a covering problem in the hypercube ⋮ On the decomposition of random hypergraphs

Cites Work

• Unnamed Item
• A new proof of a theorem of Graham and Pollak
• On decompositions of complete hypergraphs
• On shortest cocycle covers of graphs
• On embedding complete graphs into hypercubes
• Decomposition of the complete r-graph into complete r-partite r-graphs
• A polynomial space proof of the Graham-Pollak theorem
• A bound on the total size of a cut cover
• On the Size of Separating Systems and Families of Perfect Hash Functions
• On the decomposition ofkn into complete bipartite graphs
• An application of graph coloring to printed circuit testing
• The biparticity of a graph
• Perfect Hashing and Probability
• On the Addressing Problem for Loop Switching
• k-Components, Clusters and Slicings in Graphs
• Covering a graph with cuts of minimum total size

This page was built for publication: Covering Complete r-Graphs with Spanning Complete r-Partite r-Graphs