scientific article; zbMATH DE number 4065029

MaRDI QIDQ3798689zbMATH OpenFDO

Authors R. S. Rees

Publication date 1987

zbMATH Keywords

edge partitionsmallest number of cliques

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Minimal clique partitions and pairwise balanced designs
• scientific article; zbMATH DE number 4087706
• Clique covering of graphs
• Clique partitions and clique coverings
• scientific article; zbMATH DE number 3914355

Cited in

(6)

• Frames and the \(g^{(k)}(v)\) problem
• The spectrum of restricted resolvable designs with r=2
• Geometric limits and length bounds on curves
• On combinatorial designs with subdesigns
• The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\)
• The existence of restricted resolvable designs. II: (1,2)-factorizations of \(K_{2n+1}\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798689)