๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Partitions of unity and coverings

โœ Scribed by Austin, Kyle; Dydak, Jerzy


Book ID
124147179
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
329 KB
Volume
173
Category
Article
ISSN
0166-8641

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Partitions of Unity for Countable Covers
โœ Albert Fathi ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Mathematical Association of America ๐ŸŒ English โš– 197 KB
Clique partitions and clique coverings
โœ Paul Erd'ฬos; Ralph Faudree; Edward T. Ordman ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 575 KB

Several new tools are presented for determining the number of cliques needed to (edge-)partition a graph. For a graph on n vertices, the clique partition number can grow et-? times as fast as the clique covering number, where c is at least l/64. If in a clique on n vertices, the edges between cn" ve