𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimum number of edges in graphs with prescribed paths

✍ Scribed by Nicholas Pippenger

Publisher
Springer
Year
1978
Tongue
English
Weight
919 KB
Volume
12
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Covering the Edges of a Graph by a Presc
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap
✍ Noga Alon; Yair Caro; Raphael Yuster πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 360 KB

Let H=(V H , E H ) be a graph, and let k be a positive integer. A graph G=(V G , E G ) is H-coverable with overlap k if there is a covering of the edges of G by copies of H such that no edge of G is covered more than k times. Denote by overlap(H, G) the minimum k for which G is H-coverable with over

Minimum number of edges in graphs that a
Minimum number of edges in graphs that are both P2- and Pi-connected
✍ Yoko Usami πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 473 KB

A simple graph with n vertices is called Pi-connected if any two distinct vertices are connected by an elementary path of length i. In this paper, lower bounds of the number of edges in graphs that are both Pz-and Pi-connected are obtained. Namely if i ~j(n + I), then JE(G)I 3((4i -5)1(2i -2))(n -11