We show that if G is a graph embedded on the projective plane in such a way that each noncontractible cycle intersects G at least n times and the embedding is minimal with respect to this property (i.e., the representativity of the embedding is n), then G can be reduced by a series of reduction oper
Simpler Projective Plane Embedding
โ Scribed by Wendy Myrvold; Jianping Roth
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 184 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We give various conditions on pinched-torus polyhedral maps which are necessary for their graphs to be embeddable in the projective plane. Our other main result is that even if the graph of a polyhedral map in the pinched torus is embeddable in a projective plane, the map induced by the embedding ca
A blocking set B in a projective plane z of order n is a subset of T which meets every line but contains no line completely. Hence le)B n I] srz for every line i of 9r.I A blocking set is minimal if it contains no proper blocking set. A blocking set is maximal if it is not properly contained in any
A configuration D with parameters (u, b, r. k) is an incidence structure t P, B. 2 L where ? is a set of u "points'\*, 8 is a set of b '"blocks" and 7 is an 'incidence relation" between points and blocks such that each point is incident with t blocks, and each blok is incident with Fc points. A bloc