Báo cáo toán học: "How long can a graph be kept planar" pot

Báo cáo toán học: "How long can a graph be kept planar" pot

Báo cáo toán học: "How long can a graph be kept planar" pot

... Published: May 5, 2008 Mathematics Subject Classification: 9 1A2 4 Abstract The graph (non-)planarity game is played on the complete graph K n between an Enforcer and an Avoider, each of whom take one ... planar graph game on n vertices, Avoider can play at least 3n − 26 edges while keeping his graph planar. Motivation and History Positional games consist of a board, which is a fi...
Ngày tải lên : 07/08/2014, 15:22
  • 7
  • 231
  • 0
Báo cáo toán học: "How frequently is a system of 2-linear Boolean equations solvable" ppsx

Báo cáo toán học: "How frequently is a system of 2-linear Boolean equations solvable" ppsx

... we became aware of a recent paper [10] by Daud´e and Ravelomanana. They studied a close but different case, when a system of m equations is chosen uniformly at random among all n(n − 1) equations ... multigraph. (In [13] graphs G with such kernels were called clean. It is these clean graphs that are most populous asymptotically among all connected graphs on [n] with excess ℓ.) Now that w...
Ngày tải lên : 08/08/2014, 12:22
  • 50
  • 328
  • 0
Báo cáo toán học: "Cycle lengths in a permutation are typically Poisson" pot

Báo cáo toán học: "Cycle lengths in a permutation are typically Poisson" pot

... R. Arratia, A. D. Barbour and S. Tavar´e, Random combinatorial structures and prime factorizations, Notices Amer. Math. Soc. 44 (1997), 903–910. [2] P. Billingsley, On the distribution of large ... integer: Hardy and Ramanujan showed that almost all integers have ∼ log log x prime factors, and it has been shown that if p j (n) is the jth smallest prime factor of an integer then log log p j (...
Ngày tải lên : 07/08/2014, 13:21
  • 23
  • 209
  • 0
Báo cáo toán học: "Automorphism groups of a graph and a vertex-deleted subgraph" pot

Báo cáo toán học: "Automorphism groups of a graph and a vertex-deleted subgraph" pot

... Stephen G. Hartke and A. J. Radcliffe. Mckay’s canonical graph labeling algo- rithm. In Communicating Mathematics, volume 479 of Contemporary Mathe- matics, pages 99–111. American Mathematical Society, ... considering each G+v. To prune the search tree, the canonical labeling of G+v is computed, usually by nauty, McKay’s canonical labeling algorithm [McK06,HR09]. Finding a canonical label...
Ngày tải lên : 08/08/2014, 12:22
  • 8
  • 268
  • 0
Báo cáo toán học: "Chromatic Roots of a Ring of Four Cliques" potx

Báo cáo toán học: "Chromatic Roots of a Ring of Four Cliques" potx

... of Mathematics & Statistics University of Western Australia, Australia gordon@maths.uwa.edu.au Dave Wagner Department of Combinatorics and Optimization University of Waterloo, Canada dgwagner@math.uwaterloo.ca Submitted: ... root of F a, p,q,n (z) is either a real number or a non-real number with its real part equal to 0: (i) p + q is a negative integer an d a ≥ 1 − p − q; and (i...
Ngày tải lên : 08/08/2014, 14:23
  • 13
  • 225
  • 0
Báo cáo toán học: " How Many Squares Must a Binary Sequence Contain" pptx

Báo cáo toán học: " How Many Squares Must a Binary Sequence Contain" pptx

... Email: tsimpsonr@cc.curtin.edu.au Table 1. Possible pairs of q. a 1 a 2 a 2 a 1 a 3 a 1 a 4 a 3 a 1 a 3 a 2 a 4 a 3 a 5 a 5 a 2 Table 2. Possible triples of q. a 1 a 2 a 1 a 2 a 1 a 2 a 3 a 1 a 2 a 4 a 3 a 1 a 1 a 2 a 4 a 2 a 1 a 3 a 3 a 1 a 3 a 5 a 2 a 1 a 1 a 3 a 5 a 2 a 4 a 3 a 3 a 5 a 2 a 5...
Ngày tải lên : 07/08/2014, 06:20
  • 9
  • 339
  • 0
Báo cáo toán học: "How many square occurrences must a binary sequence contain?" docx

Báo cáo toán học: "How many square occurrences must a binary sequence contain?" docx

... ternary alphabet {a 1 ,a 2 ,a 3 } toawordW 5 over the quinary alphabet {a 1 ,a 2 ,a 3 ,a 4 ,a 5 },andthen by applying to W 5 a morphism to the binary alphabet {0, 1}. The first step is such that the ... results have been generalized to larger alphabets and on the other hand, to the abelian case ∗ LORIA/INRIA-Lorraine, 615, rue du Jardin Botanique B.P. 101, 54602 Villers-l`es-Na...
Ngày tải lên : 07/08/2014, 07:21
  • 11
  • 299
  • 0
Báo cáo toán học: "How different can two intersecting families be" ppsx

Báo cáo toán học: "How different can two intersecting families be" ppsx

... F  outside I, as well. Note that A is not empty, since F 1 ,F 2 A. Now for any A ∈Alet f (A) = (A \ I) ∪{1}. (Observe that for any A A there is A  A F 0 with A ∩ A  = I, A \ I = A \ A  ,sof (A) ∈ 1 ... any F ∈F 0 (because in that case we would take into account that containing relation twice when counting ρ(f (A) )). But this is clear, because a G of this form cont...
Ngày tải lên : 07/08/2014, 08:22
  • 7
  • 181
  • 0
Báo cáo khoa học: "How Much Can We Gain from Supervised Word Alignment" potx

Báo cáo khoa học: "How Much Can We Gain from Supervised Word Alignment" potx

... Seventh International Conference on Language Resources and Evaluation, Valletta, Malta. Dan Melamed. 1998. Manual annotation of translational equivalence: The blinker project. Technical Report ... that alignment errors are less harmful with more training data. We can therefore conclude the small magnitude of the gain using human alignment is not an artifact of small training. Compar...
Ngày tải lên : 23/03/2014, 16:20
  • 5
  • 275
  • 0
Từ khóa: