𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximum number of edges in a graph of bounded dimension, with applications to ring theory

✍ Scribed by Geir Agnarsson; Stefan Felsner; William T. Trotter

Book ID
108316304
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
700 KB
Volume
201
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The number of edges in a maximum cycleβ€”d
The number of edges in a maximum cycleβ€”distributed graph
✍ Yongbing Shi πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 288 KB

Shi, Y., The number of edges in a maximum cycle-distributed graph, Discrete Mathematics 104 (1992) 205-209. Let f(n) (f\*(n)) be the maximum possible number of edges in a graph (2-connected simple graph) on n vertices in which no two cycles prove that, for every integer n > 3, f(n) 3 n + k + [i( [~(

The maximum number of edges in a graph w
The maximum number of edges in a graph with fixed edge-degree
✍ R.J. Faudree; J. Sheehan πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 633 KB

Suppose that n i> 2t + 2 (t/> 17). Let G be a graph with n vertices such that its complement is connected and, for all distinct non-adjacent vertices u and v, there are at least t common neighbours. Then we prove that and Furthermore, the results are sharp.