Decomposition of large uniform hypergraphs
From MaRDI portal
Publication:762500
DOI10.1007/BF00582740zbMATH Open0558.05048OpenAlexW1998113896MaRDI QIDQ762500FDOQ762500
Zbigniew Lonc, Mirosław Truszczyński
Publication date: 1985
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00582740
Recommendations
Generalized Ramsey theory (05C55) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Intersection Theorems for Systems of Sets
- Title not available (Why is that?)
- Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
- Title not available (Why is that?)
- Decompositions of hypergraphs into hyperstars
- Hyperclaw Decomposition of Complete Hypergraphs
Cited In (15)
- Clique and anticlique partitions of graphs
- Decompositions of partially ordered sets into chains and antichains of given size
- A Helly property of arcs
- Clique and anticlique partitions of graphs
- Packing problems in edge-colored graphs
- Ramsey-remainder for convex sets and the Erdős-Szekeres theorem
- Ramsey numbers for tournaments
- Decomposition of large combinatorial structures
- Decompositions of regular bipartite graphs
- Decomposition of regular hypergraphs
- Euler tours in hypergraphs
- Delta-system decompositions of graphs
- Decomposition of the complete hypergraph into delta-systems. II
- On decomposition of hypergraphs into \(\Delta\)-systems
- Title not available (Why is that?)
This page was built for publication: Decomposition of large uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762500)
