Báo cáo toán học: " On the chromatic number of intersection graphs of convex sets in the plane" ppt

... actions and in- car dialo gue actions, for each sub-task type of the in- car system. 121 An ISU Dialogue System Exhibiting Reinforcement Learning of Dialogue Policies: Generic Slot-filling in the TALK In- car ... describe the domain in which the di- alogue system operates (an in- car” information sys- tem). Then we describe the major components...

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

... patterns as indicators of dynamic balance ability during walking. The aim of the study was to quantify the effect of impaired cognition and dual tasking on gait variability and stability in geriatric ... task. For walking without dual tasking, no significant group differences were found for any of the gait or trunk Table 2 Effect of dual tasking on gait...

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

... +1) 6 49n 6 . 7. The number of ascendants of a given node in a LBST As in the case of the number of ascendants in a random BST, computing the probability that the j th node in a random LBST has m ascendants ... other random variables: the number of descendants D n and the number of ascendants A n of a randomly chosen internal node...

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

... a given pattern Richard Arratia Department of Mathematics University of Southern California Los Angeles, CA 90089-1113 email: rarratia@math.usc.edu Submitted: July 27, 1999; Accepted: August 25, ... 1999. Abstract. Consider, for a permutation σ ∈S k ,thenumberF(n, σ) of permuta- tions in S n which avoid σ as a subpattern. The conjecture of Stanley and Wilf is that for...

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

... n)k −1 φ(k). In either case, the inequality in part 1 of the lemma holds. On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs Alan Frieze ∗ Department of Mathematical ... of combinatorics 7 (2000), #R57 4 3 Hamilton Cycles A Hamilton cycle is the union of two perfect matchings and so h(G) ≤ 1 2 m(G) 2 a...

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

... path or an oriented cycle, then ogcn(  G) ≤ 7. In fact, this bound is tight, as shown by the following: Theorem 7 There exist oriented paths with oriented game chromatic number 7. Proof. The idea ... families of oriented graphs having bounded oriented game chromatic number. In the next section, we introduce two types of “Go- like” games (by analogy to the Go board -...

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

... 2z belongs to B ∗ . the electr onic journal of combinatorics 11 (2004), #R52 5 On the chromatic number of intersection graphs of convex sets in the plane ∗ Seog-Jin Kim Department of Mathematics University ... −M(C) 4 Intersection graphs of convex sets with different sizes In this section, we study a more general case. Two convex sets K, D on t...

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

... number of vertices from the hub. the electronic journal of combinatorics 13 (2006), #R29 4 Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size Ronald Gould Department of Mathematics ... showed for l ≥ 5thatsat(n, C l ) ≥ n  1+ 1 2l+8  . We will provide an upper bound for the function sat(n, C l ) that improves the upper bound given in [1] for...

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

... for example. the electronic journal of combinatorics 14 (2007), #R37 9 A combinatorial representation with Schrăoder paths of biorthogonality of Laurent biorthogonal polynomials Shuhei Kamioka ∗ Department ... certain kinds of Schrăoder paths, which imply orthogonality and biorthogonality of LBPs. 1 Introduction and preliminaries Laurent biorthogonal polynomial...

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

... chromatic number, although we phrase it only for chromatic number. In the next section we present the lower bound in Theorem 2 and the rest of the pa- per is devoted to the proof of the upper bound. The ... coloring of a k-graph is a coloring of its vertices such that no edge is monochromatic, and the chromatic number is the minimum number of colors in...

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

... polynomial. The attraction of U is that it contains many other graph invariants as specialisations, for instance the 2 -polymatroid rank generating function of O xley and Whittle [23], and as a consequence ... that there are polynomial time alg orithms to evaluate a wide range of graph polynomials that are definable in monadic second order logic when the input graph has...

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

... balanced, and we define the chromatic and zero-free chromatic polynomials by means of (5.3) and (5.4). Proposition 5.4. The total chromatic polynomial is a weak chromatic invariant of gain graphs. ... Cat alan, Shi, and Linial graphs satisfy the hypotheses of Corollary 10.4 and the graphs between Catalan and Shi are co mplete, it is a routine matter to evaluate their...

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

... a corollary of more general results about the asymptotic results of the Ra msey number for three long even cycles. Recently, determination of some exact values of Ramsey numbers of type R( P i , ... three-color Ramsey numbers for paths versus a cycle, see [3, 4, 5, 13]. In this paper, we provide the exact value of the Ramsey numbers R(P n 1 , P n 2 , . . . , P n t , C...

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

... journal of combinatorics 18 (2011), #P36 6 Sharp threshold functions for random intersection graphs via a coupling method. Katarzyna Rybarczyk Faculty of Mathematics and Computer Science, Adam ... p) using intermediate auxiliary random graphs. From them we can deduce the assertion of the theorem. First recall (see for example [8]) that if for some graph valued rando...

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

... paper we introduce multivariate hyperedge elimination polynomials and multivariate chromatic polynomials for hypergraphs. The first set of polynomi- als is defined in terms of a deletion-contraction-extraction ... Polynomial for Special Classes of Hypergraphs Here we study the multivariate chromatic polynomials of complete r-uniform hypergraphs, complete r-unifo...

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