Báo cáo toán học: "Decomposing infinite 2-connected graphs into 3-connected component" pps

... a base distribution H. In Section 2, we sample C multinomials φ k from H. In the infinite mixture model we sample an infinite number of multinomi- als from H, using the Dirichlet process. Formally, ... set of novel infinite tree models and associated inference algorithms, which are suit- able for representing syntactic dependency structure. Because the models represent a potentially infini...

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

... 95% confidence interval. Dilemmas in the reliable estimation of the in- vitro cell viability in magnetic nanoparticle engineering: which tests and what protocols? Clare Hoskins 1 , Lijun ... number of factors including an increase in the coating diameter upon addition of the PEG moiety [33], thus increasing the stability of the nanopar...

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

... below). For information about publishing your research in Advances in Difference Equations go to http://www.advancesindifferenceequations.com/authors/instructions/ For information about other SpringerOpen ... and full text (HTML) versions will be made available soon. Biperiodicity in neutral-type delayed difference neural networks Advances in Difference Equations 2012, 2...

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

... = λ+1 3 T 6 = { 5λ+5 3 , 5λ+8 3 , , 2λ +1} then |T 6 | = λ+1 3 An infinite family of non-embeddable Hadamard designs K. Mackenzie-Fleming Department of Mathematics, Central Michigan University Mount Pleasant ... existence of an infinite family of non-embeddable 2 - (2λ +2,λ +1,λ)designs,λ = 3(2 m ) − 1,m ≥ 1 is established. Mathematical Reviews Subject Number: 05B05 Dedic...

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

... partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain. In other words, there exists an infinite collection of permutations no one of which contains ... usually much more complex than permutations. 2 The infinite antichain We are going to construct an infinite antichain, {a i }. The elements of this antichain will be very...

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

... is overlap-free. (b) 0à(x) is overlap-free if and only if 1x is overlap-free. (c) 1à(x) is overlap-free if and only if 0x is overlap-free. (d) 00à(x) is overlap-free if and only if 1x is overlap-free ... theorem. Theorem 1 Let w be a finite binary word such that there exists an infinite overlap-free binary sequence which begins with w.Letxbe the lexicographically least in...

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

... describe the structure of these graphs is in terms of graph homomorphisms. One infinite sequence of cores of dense maximal triangle-free graphs was known. All graphs in this sequence are 3- colourable. ... in contrast to a conjecture of Jin [8], saying that there are graphs of arbitrarily large chromatic number with this property. Another infinite sequence of dense...

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

... decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on 2-connected graphs to problems on 3-connected graphs. Motivated ... infinite planar graphs, we generalize Tutte’s decomposition to include all infinite 2-connected graphs. 1 Introduction In [5], Tutte presents a decomposition of a fin...

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

... round 20-set in a set with R(20, 10) having 374 points, in a set with R(13, 6) having 766 points and in a set with R(13, 7) having 330 points. These results are poor compared with the cardinalities ... of points in the Euclidean plane contains a concyclic 4-subset, then all points of V with the exception of at most two are on a circle. The same then must hold if...

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

... New infinite families of 3-designs from algebraic curves of higher genus over finite fields Byeong-Kweon Oh ∗ Department of Applied Mathematics Sejong University, ... Yang, An infinite family of 3-designs from Preparata codes over Z 4 , Des. Codes Cryptogr. 15 (1998), no. 2, 175–181. [6] T. Helleseth, C. Rong, K. Yang, New infinite families of 3-designs...

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

... |G| ≤ .  We note that an infinite locally finite graph can have infinite distinguishing number. For a simple example consider the graph that is obtained from the one-way infinite path v 0 , v 1 , ... the infinite case and find many similarities. We also determine the distinguishing number of infinite hypercubes of arbitrary dimension. To this end we take recourse to elementary results abo...

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

... communication and preprint of [2]) that typi- cal constructions of infinite families of simple 3-connected k -crossing-critical graphs create bounded numbers (wrt. k) of vertices of degrees other than ... in infinite families of k -crossing-critical graphs? We positively answer one half of his question in Theorem 3.1 and Proposition 2.1; ã namely we construct, for all k...

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

... non-normal Cayley graphs of order 4p are constructed explicitly for each pr ime p. As a result, there are fifteen sporadic and eleven infinite families of tetravalent non-normal Cayley graphs of ... tetravalent non-normal Cayley graphs of order 4p with p a prime. It appears that there are fifteen sporadic and eleven infinite families of tetravalent no n-normal Cay...

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

... families of pairs of graphs which share the same zeta function. 1. Introduction In 2009 , Cooper described an infinite family of non-isomorphic pairs of graphs which she conjectured had the same Ihara ... 2010 Mathematics Subject Classification: 05C38 Abstract In 2009, Cooper presented an infinite family of pairs of graphs which were con- jectured to have t...

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

... of A 3 the electronic journal of combinatorics 18 (2011), #P53 6 Partitioning 3-colored complete graphs into three monochromatic cycles ∗ Andr´as Gy´arf´as, Mikl´os Ruszink´o Computer and Automation ... vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the ver tices into at most...

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