𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotic values of clique partition numbers

✍ Scribed by W. D. Wallis

Book ID
110564333
Publisher
Springer-Verlag
Year
1982
Tongue
English
Weight
109 KB
Volume
2
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the number of distinct minimal clique
On the number of distinct minimal clique partitions and clique covers of a line graph
✍ Sean McGuinness; Rolf Rees πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab

On the asymptotic value of the choice nu
On the asymptotic value of the choice number of complete multi-partite graphs
✍ Nurit Gazit; Michael Krivelevich πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 144 KB πŸ‘ 1 views

## Abstract We calculate the asymptotic value of the choice number of complete multi‐partite graphs, given certain limitations on the relation between the sizes of the different sides. In the bipartite case, we prove that if __n__~0~ ≀ __n__~1~ and log__n__~0~ ≫ loglog__n__~1~, then $ch(K\_{n\_{0},

Clique numbers of graphs
Clique numbers of graphs
✍ Paul ErdΓΆs; Marcel ErnΓ© πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 337 KB

For each natural number n, denote by G(n) the set of all numbers c such that there exists a graph with exactly c cliques (i.e., complete subgraphs) and n vertices. We prove the asymptotic estimate Ia(n)l = 0(2"n -z/5) and show that all natural numbers between n + 1 and 2 "-6"5~6 belong to G(n). Thus