Criteria for ((λ 1 λ 2 ) n) vs. ((λ 1 λ 2 , . . .
Embeddings of Sλ(2, 4, v)
✍ Scribed by G. Kong; L. Zhu
- Publisher
- John Wiley and Sons
- Year
- 1994
- Tongue
- English
- Weight
- 387 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1063-8539
No coin nor oath required. For personal study only.
✦ Synopsis
It is shown that the necessary condition for a given SA(2,4,u) to be embedded in some S ~( 2 , 4 , v )
as a subdesign, namely v 2 3 u + 1, is also sufficient for the case of A = 6.
Combining this with the previously known results gives the same sufficiency for any positive integer A.
📜 SIMILAR VOLUMES
In this article, we investigate the existence of pure (v,4,A)-PMD with A = 1 and 2, and obtain the following results: (1) a pure (v, 4,1)-PMD exists for every positive integer Y = 0 or 1 (mod 4) with the exception of v = 4 and 8 and the possible exception of v = 12; (2) a pure (v,4,2)-PMD exists for
A closed 2-cell embedding of a graph embedded in some surface is an embedding such that each face is bounded by a circuit in the graph. The strong embedding conjecture says that every 2-connected graph has a closed 2-cell embedding in some surface. A graph is called k cross-cap embeddable if it can