Decomposition of large uniform hypergraphs

DOI10.1007/BF00582740zbMath0558.05048OpenAlexW1998113896MaRDI QIDQ762500

Zbigniew Lonc, Miroslaw Truszczynski

Publication date: 1985

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00582740

zbMATH Keywords

decompositionuniform hypergraphErdős-Rado theoremRamsey type theoremtournament poset

Mathematics Subject Classification ID

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

Related Items (10)

Packing problems in edge-colored graphs ⋮ Delta-system decompositions of graphs ⋮ Decomposition of large combinatorial structures ⋮ A Helly property of arcs ⋮ Decompositions of partially ordered sets into chains and antichains of given size ⋮ On decomposition of hypergraphs into \(\Delta\)-systems ⋮ Decompositions of regular bipartite graphs ⋮ Ramsey-remainder for convex sets and the Erdős-Szekeres theorem ⋮ Ramsey numbers for tournaments ⋮ Clique and anticlique partitions of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decompositions of hypergraphs into hyperstars
• Intersection Theorems for Systems of Sets
• Hyperclaw Decomposition of Complete Hypergraphs
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs

This page was built for publication: Decomposition of large uniform hypergraphs