Báo cáo toán học: " Resolving Triple Systems into Regular Configurations" pot

... line configurations in Steiner triple systems , J. Comb. Des. 3 (1995), 51-59. [10] T.S. Griggs, M.J. de Resmini, and Rosa, A.,“ Decomposing Steiner triple systems into four-line configurations”, ... 229–247. [4] C.J. Colbourn and A. Rosa, Triple Systems, Oxford University Press1999. [5] Chee, Y. M., Colbourn, C. J. and Ling, A. C. H., “Weakly union-free twofold triple systems, ”...

Ngày tải lên: 07/08/2014, 06:20

... Theory. In the next section we review basic facts about Steiner triple systems and configurations. 2 Steiner triple systems A Steiner triple system of order v, STS(v), is a pair (V, B) where V is ... graph of every Steiner triple system, with the exception of the unique systems on 7 and 9 points, is 2-e.c. Further- more, we obtain a characterization of those Steiner triple sys...

Ngày tải lên: 07/08/2014, 13:21

... vertices of a regular polygon, although the middle ring does. The size of a type 1 configuration is the cardinality of the largest symmetry class of points that forms the vertices of a regular polygon. ... 1 configuration is of size m and it does not have the symmetries of a regular m-gon, then it must have the symmetries of a regular m 2 -gon; the configuration in Figure 2 has the symme...

Ngày tải lên: 07/08/2014, 13:21

... h 3" alt =""

Ngày tải lên: 05/08/2014, 15:20

... class="bi x0 y0 w1 h 1" alt =""

Ngày tải lên: 05/08/2014, 15:20

... normalized set systems H with weight n. In particular, h  n = |L(n)| = |W (n)/∼|. Proof. We transform every (Q, P ) ∈ W (n), where Q consists of the intervals I 1 <I 2 < < I m , into the ... non-simple set systems H with weight n in the set M(n) of normalized simple set system H with weight n.Thenh  n = |M(n)|+|N(n)|≤ 2|M(n)| =2h  n . We say that a vertex v ∈ V (H)isregul...

Ngày tải lên: 07/08/2014, 08:22

... The component with one cycle may be viewed as a cycle of trees. The third component may also be decomposed into trees and cycles. Thus the first step of our enumeration is to count the rooted trees from which ... with cycles with w-trees eliminated the electronic journal of combinatorics 12 (2005), #R30 11 A triple lacunary generating function for Hermite polynomials Ira M. Gessel ∗ Depart...

Ngày tải lên: 07/08/2014, 13:21

... vertices can be decomposed into at most n 2 /4 triangles and single edges. Later Bollob´as [1] generalized this result by showing that a graph of order n can be decomposed into at most t r−1 (n) edge ... graphs into connected non- bipartite non-complete graphs of order 4 and single edges. Let H be one of the following graphs. Theorem 2.4. Any graph of order n,withn ≥ 4, can be decompo...

Ngày tải lên: 07/08/2014, 13:21

... Lat-A on packaging of actin into VLPs paral- leled that of VP40 (Fig. 2B). For example, in the presence of 1.0 and 2.5 µM lat-A, slightly more actin was packaged into VP40 VLPs (Fig. 2B, lanes ... being released from the cell (Fig. 1C). Cellular actin (red) was Packaging of actin into VLPsFigure 1 Packaging of actin into VLPs . A) Human 293T cells were mock-transfected (lane 1), or tr...

Ngày tải lên: 19/06/2014, 08:20

... configuration time, as the chances to have multi-hop connectivity between an unconfigured node that just enters into an area and the RSU decrease with the distance b etween them (D RSU ). In the motorway scenario, ... parameters, such as the size and shape of the geographical areas, should be chosen also taking into account the expected traffic conditions. For example, in sparse scenarios, ar...

Ngày tải lên: 20/06/2014, 20:20