Báo cáo toán học: "Efficient covering designs of the complete graph" pptx

Báo cáo toán học: "Efficient covering designs of the complete graph" pptx

Báo cáo toán học: "Efficient covering designs of the complete graph" pptx

... one member of L. The H -covering number of G, denoted by cov(G, H), is the minimum number of members in an H -covering design of G.(IfthereisanedgeofGwhich cannot be covered by a copy of H,we put ... create a set L 4 of copies of K h ,beginningwithL 4 =∅, Efficient covering designs of the complete graph Yair Caro ∗ and Raphael Yuster † Department of Mathematics U...
Ngày tải lên : 07/08/2014, 06:20
  • 8
  • 284
  • 0
Báo cáo toán học: "A Rainbow k-Matching in the Complete Graph with r Colors" pdf

Báo cáo toán học: "A Rainbow k-Matching in the Complete Graph with r Colors" pdf

... Theorem 1.3 , that is, the following coro llar y is obtained by Theorem 1.1. Corollary 1.4. If n ≥ 2k + 5, then the assertion of Theorem 1.3 follows from Theorem 1.1. the electronic journal of ... (2), the corresponding value to the axis of symmetry of F (q) is q = −h + k − p − 3 2 . If the middle value o f the range 0 ≤ q ≤ k − 1 − p is less than the corresponding val...
Ngày tải lên : 07/08/2014, 21:21
  • 13
  • 371
  • 0
Báo cáo toán học: " Efficient packing of unit squares in a square" ppt

Báo cáo toán học: " Efficient packing of unit squares in a square" ppt

... inside R being K(m +1)+2t 2 (2t −1) = mn +1. The total length of the projection of the K columns onto the side width of the rectangle R together those of the two trapezia is given by f(t)=4t +(K ... By refining the construction, we can improve this to n 2 ≤ 43. The improved construction is similar to that used in the proof of Theorem 2, but differs in respect of t...
Ngày tải lên : 07/08/2014, 06:23
  • 14
  • 191
  • 0
Báo cáo toán học: "Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams" doc

Báo cáo toán học: "Efficient Counting and Asymptotics of k-Noncrossing Tangled Diagrams" doc

... (3.12) and the theorem follows. Acknowledgments. We are grateful to Emma Y. Jin for helpful discussions. This work was support ed by the 973 Project, the PCSIRT Project of the Ministry of Education, the ... a horizontal line. The arcs are d rawn in the up per half- plane with a particular notion of crossings and nestings. Our main result is the asymptotic formula for th...
Ngày tải lên : 07/08/2014, 21:21
  • 8
  • 175
  • 0
Báo cáo toán học: " Metabolite proving fungal cleavage of the aromatic core part of a fluoroquinolone antibiotic" pdf

Báo cáo toán học: " Metabolite proving fungal cleavage of the aromatic core part of a fluoroquinolone antibiotic" pdf

... cleavage of the aromatic fluoroquinolone core for the first time. Hence, two decades after the emergence of the notion of the non- biodegradability of fluoroquinolones, fungal degradation of all ... in the lipids of E. coli (Goldfine 1982). Two decades after the emergence of the notion of the non-biodegradability of FQs, briefly reviewed by Wetzstein et al...
Ngày tải lên : 20/06/2014, 21:20
  • 23
  • 294
  • 0
Báo cáo toán học: "An On-Line Version of the Encyclopedia of Integer Sequences" doc

Báo cáo toán học: "An On-Line Version of the Encyclopedia of Integer Sequences" doc

... if the sequence is not in the table), and furthermore will apply a series of transfor- mations to a given sequence and then look up the transformed sequences in the table. The advantage of the ... cards, but now they are recorded on magnetic disks. The technology has improved; the food is as bad as ever. 3. The format of the reply The reply to the above query ill...
Ngày tải lên : 07/08/2014, 06:20
  • 5
  • 290
  • 0
Báo cáo toán học: "A Large Dihedral Symmetry of the Set of Alternating Sign Matrices" docx

Báo cáo toán học: "A Large Dihedral Symmetry of the Set of Alternating Sign Matrices" docx

... entries of a height function matrix for an ASM should be thought of as ofset from the entries of the ASM itself. If the entries of the ASM lie on vertices in the square grid, then the entries of the height ... (odd). Then H S preserves 2 of the colorings of the edges of S and reverses the colors in the other 14. Figure 6 shows the effect of H S on S fo...
Ngày tải lên : 07/08/2014, 06:20
  • 13
  • 339
  • 0
Báo cáo toán học: " A Purely Combinatorial Proof of the Hadwiger Debrunner (p, q) Conjectur" docx

Báo cáo toán học: " A Purely Combinatorial Proof of the Hadwiger Debrunner (p, q) Conjectur" docx

... will meet each of the original sets. Proof of Lemma 1. If we can find a set of f (d, g) points that meets the convex hull of every subset of g|Q| of the elements of Q,itwillmeeteveryoneofourpolytopes. In ... (1−(p−1)h). Weexaggeratethisfactorbyreplacingitby(1−hp 2 /2);ifweuseLemma3,andset h=i/(d+1),weobtain i=(  q d+1  /  p d+1  )(1−ip 2 /(2(d+1)))or i=  q d+1  /  p...
Ngày tải lên : 07/08/2014, 06:22
  • 8
  • 379
  • 0
Từ khóa: