𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On groups with large character degree sums

✍ Scribed by Hung P. Tong-Viet

Book ID
118777504
Publisher
Springer
Year
2012
Tongue
English
Weight
154 KB
Volume
99
Category
Article
ISSN
0003-889X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complete subgraphs with large degree sum
Complete subgraphs with large degree sums
✍ Ralph J. Faudree πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 368 KB

## Abstract Let __t__(__n, k__) denote the TurΓ‘n numberβ€”the maximum number of edges in a graph on __n__ vertices that does not contain a complete graph __K__~k+1~. It is shown that if __G__ is a graph on __n__ vertices with __n__ β‰₯ __k__^2^(__k__ – 1)/4 and __m__ < __t__(__n, k__) edges, then __G__

Cycles through subsets with large degree
Cycles through subsets with large degree sums
✍ Hajo Broersma; Hao Li; Jianping Li; Feng Tian; Henk Jan Veldman πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 583 KB

Let G be a 2-connected graph on n vertices and let X C\_\_ V(G). We say that G is X-cyclable if G has an X-cycle, i.e., a cycle containing all vertices of X. We denote by ~(X) the maximum number of pairwise nonadjacent vertices in the subgraph G[X] of G induced by X. If G[X] is not complete, we deno