𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The number of intersections between two rectangular paths

✍ Scribed by Wang, Y.-L.; Lee, R.C.T.; Chang, J.S.

Book ID
119772358
Publisher
IEEE
Year
1989
Tongue
English
Weight
711 KB
Volume
38
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Pairs of Lattice Paths with a Given N
On Pairs of Lattice Paths with a Given Number of Intersections
✍ Markus Fulmek πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 307 KB

This formula was proved in [2] by means of generating functions. ## 2. INTERPRETATION OF THE FORMULA'S SUMMANDS Our bijection is based on an appropriate lattice-path-interpretation for the formula's summands (pointed out by Krattenthaler [4]): Clearly, we article no. TA962754 154 0097-3165Γ‚97 25.0

The 2-intersection number of paths and b
The 2-intersection number of paths and bounded-degree trees
✍ Michael S. Jacobson; AndrΓ© E. KΓ©zdy; Douglas B. West πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 416 KB πŸ‘ 1 views

## Abstract We represent a graph by assigning each vertex a finite set such that vertices are adjacent if and only if the corresponding sets have at least two common elements. The __2‐intersection number__ ΞΈ~2~(__G__) of a graph __G__ is the minimum size of the union of sets in such a representatio