Affordable Access

Publisher Website

The maximal sizes of faces and vertices in an arrangement

Authors
Journal
Discrete Mathematics
0012-365X
Publisher
Elsevier
Publication Date
Volume
28
Issue
3
Identifiers
DOI: 10.1016/0012-365x(79)90142-0

Abstract

Abstract Let A be an arragement of n lines in the plane. Suppose that F 1,…, F r are faces of A and that V,…, V s are vertices of A. Suppose also that each F i is a (V j ) of the lines of A intersect at V j . Then we show that ∑ i=1 r t(F i + ∑ j=1 s t(V j)⩾n+4 r 2 + s 2 + 2rs .

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

On the maximal number of edges of many faces in an...

on Journal of Combinatorial Theor... Jan 01, 1986

Coloring vertices and faces of maps on surfaces

on Discrete Mathematics Jan 01, 2010

On maximal independent sets of vertices in claw-fr...

on Journal of Combinatorial Theor... Jan 01, 1980

On the maximal volume of convex bodies with few ve...

on Journal of Combinatorial Theor... Jan 01, 1976
More articles like this..