Báo cáo toán học: "Bounding the number of edges in permutation graphs" pdf

... 1998. Abstract. The number of descendants of a node in a binary search tree (BST) is the size of the subtree having this node as a root; the number of ascendants is the number of nodes on the path connecting ... descendant of itself. The number of ascendants A n,j is the number of internal nodes in the path from the root of the tree to th...

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

... contain three edges — (x, x  ), (y, y  )and(z, z  ) — from a single cycle C i of F , the remaining edges coming from F − . The labeling of vertices in C can be made canonical in the following ... (d +2) ν n! ν!2 ν completing the proof of part (a) of Theorem 1. the electronic journal of combinatorics 7 (2000), #R57 5 Part 2 of the lemma follows from the ch...

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

... is not the case. We approximate the c n (m) by the coefficients d n (m) of the expan- sion in power series of the principal part D m of C m in a neighbourhood of its dominant singularity 1. The sequences  d n−k (m)/d n (m)  n are ... is the exponential generating function (EGF, formal series) of the m-thpowersinthegroups n . This means that the number of m-...

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

... 9]. The numbers d k and w k are then obtained by Corollaries 2 and 7, the results are shown in Table 1 and Figure 3. Seeking a good fit, one may approximate these values in the following form: the ... sum” (p + q, ) is the canonical representative for the ordinal sum P ⊕Q. More involved is the proof of the following property of the “canonical 2-sum” P + 2 Q := (p + q...

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

... 3.2. The region of fixed edges of the FPL configurations corresponding to the matching in Conjecture 1.1 contains all the edges indicated in Figure 3.3, that is: (1) all the horizontal edges in the ... E 2 encodes the set of vertical edges crossing the segment ξ 2 , F 1 the set of edges crossing the segment η 1 and finally F 2 the set of edges cr...

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

... the number of perfect matchings in G(R). Finding a maximising k ×n Latin rectangle is equivalent to maximising the number of perfect matchings in an (n − k)-regular subgraph of K n,n . The other ... completes the proof of the ‘small’ cases. The entire calculation was checked independently by numerical integration. Combined with the results of the preceding se...

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

... management of training institutions. Outside of the MoH, the Cabinet Office and the Minis- try of Finance control the annual budget for all minis- tries. The Ministry of Education and the Ministry of Science, ... expanding teaching, studying, office, and dining space. The national number of teaching staff must increase by 363 (111% increase) over the next five ye...

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

... on R d . In recent years, there has been an increasing interest in the study of the asymptotic behavior of the solutions of both convolution and non-convolution-type linear and nonlinear Volterra ... aim in this section is to obtain sufficient condition for the boundedness of the solution of (1.1) under the initial condition (1.2), but in the linear case of Vol...

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

... during multiple natural disasters in the past 2 decades, including the earthquake in Armenia in 1988 [35], Wenchuan, China, in 2008 [36], and Haiti in 2010 [37], and the tsunami in Indonesia in ... loss remains an important complication of trauma in the resource-limited settings. Injuries are among the top ten leading causes of death and disability in the...

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

... accom- panying sequence of x in the components of the intersection of sliding sets. Clearly, the set {B 1 ,B 2 , ,B k } itself is just the set of all components of the intersection of sliding sets containing ... this proposition, the number |α i ∩ S j | determines in some sense the number of fixed points. In order to reduce the number of fixed points...

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