𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Almost every graph has a fixed edge

✍ Scribed by Hongbing Fan

Book ID
105641665
Publisher
Springer
Year
1998
Tongue
English
Weight
220 KB
Volume
43
Category
Article
ISSN
1001-6538

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Almost every graph has reconstruction nu
Almost every graph has reconstruction number three
✍ BΓ©la BollobΓ‘s πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 153 KB

## Abstract The paper contains a proof of the conjecture of Harary and Plantholt, stated in the title.

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.