Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs
type: Item
instance of: scholarly article
title: Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs
zbMATH Open document ID: 0493.05048
DOI: 10.1016/0097-3165(82)90023-1
author: Fan Chung
author: Ron Graham
author: P. Erdős
published in: Journal of Combinatorial Theory. Series A
publication date: 1982-01-01T00:00:00Z
review text: The authors tackle the following problem: given a family\(\{H_1,\dots,H_k\}\) of \(r\)-uniform hypergraphs, each with the same number of edges, find the smallest \(t\) such that each \(H_i\) can be decomposed into mutually isomorphic subhypergraphs \(E_{ij},1\leq j\leq t\). This study extends the authors' previous work on the case \(r=2\) [Combinatorica 1, 13-24 (1981)]. The main techniques used are interesting counting arguments. The results obtained are good but not sharp, so many open problems remain.
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 3775574
zbMATH Keywords: uniform hypergraphs
zbMATH Keywords: decompositions into isomorphic subhypergraphs
MaRDI profile type: Publication
full work available at URL: 0097-3165(82)90023-1
OpenAlex ID: W2159937022
cites work: Q3872501
cites work: Minimal decompositions of graphs into mutually isomorphic subgraphs
description: scientific article; zbMATH DE number 3775574