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

The clique numbers of regular graphs of matrix algebras are finite

โœ Scribed by S. Akbari; M. Jamaali; S.A. Seyed Fakhari

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
96 KB
Volume
431
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis

Let F be a field, char(F) / = 2, and S โŠ† GL n (F), where n is a positive integer. In this paper we show that if for every distinct elements

x, y โˆˆ S, x + y is singular, then S is finite. We conjecture that this result is true if one replaces field with a division ring.

๐Ÿ“œ SIMILAR VOLUMES

The maximum number of cliques in dense g
The maximum number of cliques in dense graphs
โœ Bruce Hedman ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 372 KB

Denote the number of vertices of G by ]G[. A clique of graph G is a maximal complete subgraph. The density oJ(G) is the number of vertices in the largest clique of G. If ยขo(G)>~ยฝ ]GI, then G has at most 2 tยฐl-'cG) cliques. The extremal graphs are then examined as wen. ## Terminology We will be co

On the Ramsey number of trees versus gra
On the Ramsey number of trees versus graphs with large clique number
โœ Ronald J. Gould; Michael S. Jacobson ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 335 KB

Chvatal established that r(T,, K,,) = (m -1 ) ( n -1 ) + 1, where T, , , is an arbitrary tree of order m and K, is the complete graph of order n. This result was extended by Chartrand, Gould, and Polimeni who showed K, could be replaced by a graph with clique number n and order n + 5 provided n 2 3