𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Angle orders, regularn-gon orders and the crossing number

✍ Scribed by Nicola Santoro; Jorge Urrutia

Publisher
Springer Netherlands
Year
1987
Tongue
English
Weight
674 KB
Volume
4
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Circle orders,N-gon orders and the cross
Circle orders,N-gon orders and the crossing number
✍ J. B. Sidney; S. J. Sidney; Jorge Urrutia πŸ“‚ Article πŸ“… 1988 πŸ› Springer Netherlands 🌐 English βš– 583 KB

Let d!= {P, , . . . . P,} be a family of sets. A partial order P(@, <) on CD is naturally defined by the condition P, < 5 iff P, is contained in 4. When the elements of Cg are disks (i.e. circles together with their interiors), P(@, <) is called a circle order; if the elements of Cg are n-polygons,

Cyclic-order graphs and Zarankiewicz's c
Cyclic-order graphs and Zarankiewicz's crossing-number conjecture
✍ D. R. Woodall πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 750 KB

## Abstract Zarankiewicz's conjecture, that the crossing number of the complete‐bipartite graph __K__~__m, n__~ is [1/2 __m__] [1/2 (__m__] βˆ’1) [1/2 __n__] [1/2 (__n__ βˆ’1)], was proved by Kleitman when min(__m, n__) ≀ 6, but was unsettled in all other cases. The cyclic‐order graph CO__n__ arises na

The number of order-preserving maps of f
The number of order-preserving maps of fences and crowns
✍ J. D. Currie; T. I. Visentin πŸ“‚ Article πŸ“… 1991 πŸ› Springer Netherlands 🌐 English βš– 460 KB

We perform an exact enumeration of the order-preserving maps of fences (zig-zags) and crowns (cycles). From this we derive asymptotic results.