𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the number of edges in cycletrees

✍ Scribed by Margus Veanes; Jonas Barklund

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
436 KB
Volume
57
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the extremal number of edges in hamil
On the extremal number of edges in hamiltonian connected graphs
✍ Tung-Yang Ho; Cheng-Kuan Lin; Jimmy J.M. Tan; D. Frank Hsu; Lih-Hsing Hsu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 421 KB

a b s t r a c t Assume that n and Ξ΄ are positive integers with 3 ≀ Ξ΄ < n. Let hc(n, Ξ΄) be the minimum number of edges required to guarantee an n-vertex graph G with minimum degree Ξ΄(G) β‰₯ Ξ΄ to be hamiltonian connected.

On the Number of Edges of Quadrilateral-
On the Number of Edges of Quadrilateral-Free Graphs
✍ ZoltΓ‘n FΓΌredi πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 247 KB

If a graph has q 2 +q+1 vertices (q>13), e edges and no 4-cycles then e 1 2 q(q+1) 2 . Equality holds for graphs obtained from finite projective planes with polarities. This partly answers a question of Erdo s from the 1930's. 1996 Academic Press, Inc. ## 1. Results Let f (n) denote the maximum n