Báo cáo tin học: "On the Resilience of Long Cycles in Random Graphshan" ppsx

... upper and a lower bound on the global resilience r g of G w.r.t. containing long cycles. the electronic journal of combinatorics 15 (2008), #R32 9 the vertices. The proof of Theorem 8 is thus readily ... for the remaining vertices of size w(α)n. Clearly, if one deletes all edges with endpoints in distinct partition classes, only cycles of length at most (1−α)n rem...

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

... obtained by pointwise multiplication of the entries in the first half by the alternating character. the electronic journal of combinatorics 14 (2007), #R82 4 obtained from λ by removing the principal ... the ring Z[x 1 , x 2 , . . . , x n ] of all polynomial functions in n variables over the integers. The sym- metric group acts by permuting variables, and the invari...

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

... Annotations of the major components. (B) Interpretation of the data discussed in the text. In this panel, the phases of ATP and G6P have been flipped 180°, indicating the relative phases of the minima of ... structure indicates that the system can be des- cribed in terms of two interacting modes. The first mode activates the second, and the second inhibits...

Ngày tải lên: 30/03/2014, 16:20

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

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

... “tubes” joining the interiors of the faces chosen in Ψ to the interiors of the faces chosen in Ψ  . If k =2, 5, let v 0 be any vertex of K m −K 2 which is not an endvertex of the missing edge. ... v 1 ,v and v 2 in clockwise order. In these the electronic journal of combinatorics 9 (2002), #R38 5 5. The Interval of Saturation the Orientable Case Before pres...

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

... o(1)) |E| k k! q − ( k 2 ) , completing the proof of Theorem 1.2. Acknowledgments The research is performed during the author’s visit at the Erwin Schr¨odinger International Institute for Mathematical Physics. The author ... theoretic methods. The main result of this note is the following. the electronic journal of combinatorics 15 (2008), #N32 1 Note that the above th...

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

... 1 . 2 The number of matchings in a tree In t his section, we turn to the number of matchings in a graph. This is a lso known as the Hosoya index, or the Z-index in mathematical chemistry. For ... An interesting paper of Wagner [5] looks at the number of independent sets modulo m. Wagner showed that the pr oportion of trees on n vertices with the number of ind...

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

... be the set of all beamlets of an arrangement of intensity modulated beams, or the set of all arclets of radiosurgery arcs. The basis set defines the parameter space of the optimisation as the ... present in the IMRT setting, the set of minimizers is a sizeable, high dimensional, closed and connected subset of the parameter space. Any such point in this so...

Ngày tải lên: 09/08/2014, 10:21

... permutation matrices. Just looking at the first column, we now obtain a 3-colouring of G, choosing the colour according to the row in which the nonzero entry of the column vector is. Proposition ... H ∼ = C n , in which the inner product is written ·|·. Here, n is the dimension of S. Note that by physics convention the inner product is linear in the second argum...

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