H-decompositions of r-graphs when H is an r-graph with exactly 2 edges

MaRDI QIDQ2380474zbMATH OpenFDO

Authors Teresa Sousa

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/224083, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r40.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51)

Recommendations

• \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges
• Decomposing uniform hypergraphs into uniform hypertrees and single edges
• Minimum \(H\)-decompositions of graphs
• Decomposition of the complete r-graph into complete r-partite r-graphs
• Decomposing the complete \(r\)-graph

Cited in

(4)

• Decomposing uniform hypergraphs into uniform hypertrees and single edges
• \(H\)-decomposition of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly \(k\) independent edges
• Minimum weight \(H\)-decompositions of graphs: the bipartite case
• scientific article; zbMATH DE number 6605190 (Why is no real title available?)

This page was built for publication: \(H\)-decompositions of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly 2 edges

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