On the edge-coloring property for Hanani triple systems (Q1966117)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the edge-coloring property for Hanani triple systems |
scientific article |
Statements
On the edge-coloring property for Hanani triple systems (English)
0 references
24 February 2000
0 references
The closure of a hypergraph is obtained by including, for each hyperedge, all of its subsets as hyperedges. It is shown that the closure of every Hanani triple system is resolvable.
0 references
hypergraph
0 references
Hanani triple system
0 references
