𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A method of planning the construction of cop-and-cop yarn for a simultaneous rupture of the yarn components

✍ Scribed by I. Yu. Fridman; M. P. Nosov

Publisher
Springer US
Year
1971
Tongue
English
Weight
262 KB
Volume
2
Category
Article
ISSN
0015-0541

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A better bound for the cop number of gen
A better bound for the cop number of general graphs
✍ Ehsan Chiniforooshan πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 85 KB

## Abstract In this note, we prove that the cop number of any __n__‐vertex graph __G__, denoted by ${{c}}({{G}})$, is at most ${{O}}\big({{{n}}\over {{\rm lg}} {{n}}}\big)$. Meyniel conjectured ${{c}}({{G}})={{O}}(\sqrt{{{n}}})$. It appears that the best previously known sublinear upper‐bound is du