On tours that contain all edges of a hypergraph.
Packing of nonuniform hypergraphs - product and sum of sizes conditions
Hypergraphs of order n are mutually packable if one can find their edge disjoint copies in the complete hypergraph of order n. We prove that two hypergraphs are mutually packable if the product of their sizes satisfies some upper bound. Moreover we show that an arbitrary set of the hypergraphs is mutually packable if the sum of their sizes is sufficiently small.
Page 1