Báo cáo toán học: "Large holes in quasi-random graphs" pptx

... teaching Chinese as a foreign language: A case study of native Chinese teachers in Beijing. In Language alternation, language choice and language encounter in international education, eds. Hartmut ... words: Chinese as a foreign language; English as a lingua franca; Sinophone identity; code choice; multilingual classroom Background While Chine...

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

... integrated framework for modeling, analyzing and simulating biological processes, and review several modeling formalisms that have been used in Systems Biology including Boolean networks, Bayesian ... used for modeling dynamical systems in several areas. Systems of non-linear ordinary differential equations (ODEs) have been used in SB to describe the variation of the amount...

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

...

Ngày tải lên: 05/08/2014, 09:46

... alt =""

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

... class="bi x0 y0 w3 h 5" alt =""

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

...

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

... and M. D. Plummer, Matching Theory, Akad´emiai Kiad´o, Budapest, 1986 [6] H. Minc, Nonnegative Matrices, Wiley, 1988 [7] V. Răodl and A. Rucinski, Perfect matchings in -regular graphs and the ... bound follows by applying the Stirling approximation formula for factorials. It is worth noting that since every -regular graph with density d and 2n vertices contains, in each color cla...

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

... set. Such maximal non-singular sets do exist for all t. We may now describe the graphs occurring in our construction of equiangular lines. Let K be a Kerdock set of alternating forms on V , where ... thus obtain an equiangular set of 2 9 (d +1) 2 lines in Euclidean d-space, whenever d =3q − 1=3· 2 2t−1 − 1 for some positive integer t. This completes the presentation and...

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

... electronic journal of combinatorics 14 (2007), #N1 4 Maximum matchings in regular graphs of high girth Abraham D. Flaxman Microsoft Research Redmond, Washington, USA abie@microsoft.com Shlomo Hoory IBM ... The set of incidence vectors of the matchings of G have a convex hull which is equal to the polytope containing all x ∈ R E which satisfy the following the electronic...

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

... t). A join pair (G, t) is a join covered pair if each edge of G lies in a minimum t-join. Note that if T is a t-join in a join pair (G, t) and C is a circuit with more than half its edges in T , ... circuit containing P also contains all the other ears of X, including Q. By the inductive hypothesis, H has a comb T  H , equivalent to T ∩ EH, that has a balanced circuit containing e and...

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

... checking if the given graph is (d; ε 1 , ε 2 )-regular we need to consider only sets of the size ε 1 |V i |, i = 1, 2. In the following section we state our main results proved in Sections 3. In ... counting edges between sets U and W . Note, that each of these random variables has the same binomial distribution with expected value à = |U||W |d = 2 n 2 d. Applying Chernoff’s inequality...

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

... Finally, in Section 5, based on this study, we give very short proofs of our main results – Theorems 4, 5, 6 and 7. 2 Embedding trees in expanding graphs We start by defining a class of expanding ... almost spanning trees in random graphs, submitted. [4] J. Friedman and N. Pipp enger, Expanding graphs contain all small trees, Combinator- ica 7 (1 987), 71–76. [5] P. Haxell, Tr...

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

... b 1 (mod 2 α 1 ). Since k is even, b 1 − 1 is relatively prime to 2 α 1 . Combining this with the relations discussed in the m odd case and applying the Chinese Remainder Theorem results in q, q  relatively ... main theorem for T containing only reflections, we call this the reflection main theorem. We then generalize to all T ∈ D n m . 3 Preliminaries and the Main Lemma Before proving the...

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

... of L are linear combinations of columns of A and neither of the columns of A appears more than once in these linear combinations. Therefore, by lemma 6, tmind(G) = 1. the electronic journal of ... a collection of lists of size 2 assigned to the vertices and the edges of a complete graph G = K n . There are (at least) two neighbour distinguishing total weightings of G with...

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

... rotary polygons can be determined from Theorem 4.3. We show them in Figure 6. Here again we can realize the configuration with points and lines in the (projective) plane and showing the rotary polygons ... small order containing information on the number and symmetry types of corresponding rotary polygons. 1 Introduction Various problems regarding the polygons (or multilaterals) i...

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