Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative
type: Item
instance of: scholarly article
title: Every \(H\)-decomposition of \(K_n\) has a nearly resolvable alternative
zbMATH Open document ID: 0966.05058
author: Noga Alon
author: Raphael Yuster
published in: European Journal of Combinatorics
publication date: 2001-08-12T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1538565
zbMATH Keywords: decomposition
zbMATH Keywords: complete graph
zbMATH Keywords: colour class
MaRDI profile type: Publication
full work available at URL: eujc.2000.0400
OpenAlex ID: W2033389393
cites work: Q3852212
cites work: Q4873725
cites work: Asymptotically good list-colorings
cites work: Asymptotic behavior of the chromatic index for hypergraphs
cites work: Q4083463
cites work: An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
DOI: 10.1006/EUJC.2000.0400
description: scientific article; zbMATH DE number 1538565