𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tight bounds on a problem of lines and intersections

✍ Scribed by Micha Sharir; Steven S. Skiena

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
100 KB
Volume
89
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On families of finite sets with bounds o
On families of finite sets with bounds on unions and intersections
✍ Chang Bang; Henry Sharp Jr.; Peter Winkler πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 364 KB

We present a conjecture, with some supporting results, concerning the maximum size of a family of subsets satisfying the following conditions: the intersection of any two members of the family has cardinal@ at least s, and the intersection of the complements of any two members has cardinal@ at least

Tight bounds on the chromatic sum of a c
Tight bounds on the chromatic sum of a connected graph
✍ Carsten Thomassen; Paul ErdΓΆs; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 236 KB πŸ‘ 1 views
On Number of Circles Intersected by a Li
On Number of Circles Intersected by a Line
✍ Lu Yang; Jingzhong Zhang; Weinian Zhang πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 394 KB
A tight lower bound on the maximum genus
A tight lower bound on the maximum genus of a simplicial graph
✍ Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 856 KB

It is proved that every connected simplicial graph with minimum valence at least three has maximum genus at least one-quarter of its cycle rank. This follows from the technical result that every 3-regular simplicial graph except K4 has a Xuong co-tree whose odd components have only one edge each. It