Abstract
We determine a minimum cardinality family ℱn, k (resp. ℋn, k) of n-uniform, k-edge hypergraphs satisfying the following property: all, except for finitely many, n-uniform hypergraphs satisfying the divisibility condition have an ℱn, k-decomposition (resp. vertex ℋn, k-decomposition).
| Original language | English |
|---|---|
| Pages (from-to) | 345-350 |
| Number of pages | 6 |
| Journal | Order |
| Volume | 1 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 1985 |
Keywords
- AMS (MOS) subject classification (1980): 05C70
- Ramsey type theorem
- Uniform hypergraph
- decomposition
- graph
- poset
- tournament
ASJC Scopus subject areas
- Algebra and Number Theory
- Geometry and Topology
- Computational Theory and Mathematics