7 resultados para embeddings
em University of Queensland eSpace - Australia
Resumo:
Denote the set of 21 non-isomorphic cubic graphs of order 10 by L. We first determine precisely which L is an element of L occur as the leave of a partial Steiner triple system, thus settling the existence problem for partial Steiner triple systems of order 10 with cubic leaves. Then we settle the embedding problem for partial Steiner triple systems with leaves L is an element of L. This second result is obtained as a corollary of a more general result which gives, for each integer v greater than or equal to 10 and each L is an element of L, necessary and sufficient conditions for the existence of a partial Steiner triple system of order v with leave consisting of the complement of L and v - 10 isolated vertices. (C) 2004 Elsevier B.V. All rights reserved.
Resumo:
Any partial Steiner triple system of order u can be embedded in a Steiner triple system of order v if v equivalent to 1, 3 (mod 6) and v greater than or equal to 3u - 2. (C) 2004 Elsevier Inc. All rights reserved.
Resumo:
Let D denote the graph consisting of a cycle of length 4 with a pendant edge. In this paper, two very different small embeddings of partial D-designs are presented. (c) 2005 Elsevier B.V. All rights reserved.
Resumo:
In this paper we study the following p(x)-Laplacian problem: -div(a(x)&VERBAR;&DEL; u&VERBAR;(p(x)-2)&DEL; u)+b(x)&VERBAR; u&VERBAR;(p(x)-2)u = f(x, u), x ε &UOmega;, u = 0, on &PARTIAL; &UOmega;, where 1< p(1) &LE; p(x) &LE; p(2) < n, &UOmega; &SUB; R-n is a bounded domain and applying the mountain pass theorem we obtain the existence of solutions in W-0(1,p(x)) for the p(x)-Laplacian problems in the superlinear and sublinear cases. © 2004 Elsevier Inc. All rights reserved.