Decomposition of large combinatorial structures

DOI10.1007/BF01194393zbMath0653.05053MaRDI QIDQ1107544

Yair Caro

Publication date: 1989

Published in: Archiv der Mathematik (Search for Journal in Brave)

zbMATH Keywords

decompositionuniform hypergraphedge partitionfamily of hypergraphsgeneralizations to other combinatorial structures

Mathematics Subject Classification ID

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

Related Items (4)

A note on some embedding problems for oriented graphs ⋮ Decompositions of partially ordered sets into chains and antichains of given size ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree

Cites Work

• Decomposition of large uniform hypergraphs
• A note on the decomposition of graphs into isomorphic matchings
• NP-completeness of graph decomposition problems
• Intersection Theorems for Systems of Sets
• The decomposition of trees into subtrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition of large combinatorial structures