This is the first of a series of several papers dealing with various combinatorial properties of triangulations. The problems generally have their origin in combinatorial theory, but are illuminated by viewing them from a more topological viewpoint. Successive papers will deal with a generalization
On the combinatorial structure of 3N + 1 predecessor sets
✍ Scribed by Günther Wirsching
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 762 KB
- Volume
- 148
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
By the theory of Vassiliev invariants, the knowledge of a certain algebra B, defined as generated by graphs, is essentially as good as the knowledge of the space of Vassiliev invariants. We will prove that the subspace B c 2, u of B generated by all connected diagrams with 4+2u vertices, including u
Kupitz, Y.S., On the existence of a combinatorial Schlegel diagram of a simplicial unstacked 3-polytope with a prescribed set of vertices, Discrete Mathematics 120 (1993) 121-134. It is shown that, except for two well defined configurations, any finite set V c Rz with exactly three points on I? V is