Asymptotic values of clique partition numbers

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1982 English Publisher:Springer Science and Business Media LLCJournal:Combinatorica, volume 2, pages 99-101 (issn: 0209-9683, eissn: 1439-6912,

Copyright policy )

Authors: W. D. Wallis;

doi: 10.1007/bf02579286

Asymptotic values of clique partition numbers

- Summary
- Subjects
- Metrics

Abstract

The problem is considered of decomposing a given graph into the minimum number of complete subgraphs. Asymptotic results are obtained for the case where the graph is the complement of a graph with relatively few unisolated vertices.

Related Organizations

University of Newcastle Australia
Australia

Keywords

Extremal problems in graph theory, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), complete subgraphs, cliques, clique partition

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	12
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average