Báo cáo toán học: "On two problems regarding the Hamiltonian cycle game" ppsx

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

... alt =""

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

... class="bi x0 y4 w1 h 8" alt =""

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

... On Convergence of Two-Parameter Multivalued Pramarts and Mils 39 7. F. Hiai and H. Umegaki, Integrables, conditional expectations and martingales of multivalued functions, ... North-Holland, Amsterdam, 1975. 16. M. Talagrand, Some structure results for martingales in limit and pramarts, The Ann. Prob. 13 (1975). 17. Z. Wang and X. Xue, On convergence and closednes...

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

... solution of one of the above systems, under some addi- tional conditions, is also a solution of some other systems of quasi-optimization problems, quasi-equilibrium problems, quasivariational problems ... some new results on the existence of solutions to systems concerning the following quasivariational inclusions. (UQVIP), Upper quasivariational inclusion problem...

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

... standard(C) and the set of standard marked Catalan trees by standard(C, ∗). The standard trees in C 4 are , , , , . One of the standard trees in CH 3 is . The standard tree representing the class [T ... those trees which are largest in their equivalence class as standard trees, and use them as equivalence class representatives. We will de- note the set of standard...

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

... related to the automorphism groups of trees have been investigated. We state, for instance, the enumeration of identity trees (see [7]), and the question of determining the average size of the automorphism ... to G. Labelle for the summed cycle indices of all rooted trees, which resembles the well-known formula for the cycle index of the symme...

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

... is r -identifying in all graphs G  that can be obtained from G by deleting at most t edges, we say that C is robust against t known edge deletions. Codes that are robust against t unknown edge ... to study codes that remain identifying, for instance, when some edges are deleted in the underlying graph. In this paper we consider the following two classe...

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

... decreasing (resp. increasing), and so the log-concavity implies the unimodality. The unimodality problems, including concavity (convexity) and log- concavity (log-convexity), arise naturally in many ... combinatorial interpretation. Lattice path techniques have been shown to be useful in solving the unimodality problem. As an example, we present a combinatorial proof of Theorem 1 (i...

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

... follows since 4 ≤ e(B k (S)) = the electronic journal of combinatorics 16 (2009), #R28 10 On two problems regarding the Hamiltonian cycle game Dan Hefetz Institute of Theoretical Computer Science ETH ... vertices are the edges of K n , and whose hyperedges are the edge sets of all Hamiltonian cycles of K n . In this paper we study the fair Maker-Breaker Hamiltonian c...

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

... chain on d -regular graphs with randomised size to model (a simplified version of) the SWAN network. The moves of the Markov chain are by clothespinning or the reverse. They obtained bounds on the ... achieved by coupling in [10] is tig ht, in the sense that the ǫ-mixing time is not o(ǫ −1 ). The proof f ocusses on the number of 3-cycles. During the pegging...

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

... Journal of Combinatorics 27 (2006) 193- 206.], that when the normalizer of Γ 0 (N) acts transitively on Q ∪ {∞}, any circuit in the suborbital graph G(∞, u/n) for the normalizer of Γ 0 (N), is of the ... Theorem3.1, C ∗ is of the form v → T (v) → T 2 (v) → T 3 (v) → · ·· → T k−1 (v) → v the electronic journal of combinatorics 16 (2009), #R116 13 On Suborbital...

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

... m) ≍ log m. Here and in the sequel the symbol a ≍ b means a ≪ b and b ≪ a while the electronic journal of combinatorics 17 (2010), #R100 6 On some densities in the set of permutations Eugenijus ... nontrivial outside the region of classical large deviations. Further, we apply them by inserting into the equalities given in Proposition 1. The very idea goes back...

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

... constant of G and r(G) the rank of G . ã Let ol(G) denote the maximal length of a sequence X over G which is zero-sum free and squarefree. The invariant ol(G) is called the Olson constant of G. 3 ... progression of difference d, then |(S + x)\S| = min{|S|, n − |S|, k, n − k}, the electronic journal of combinatorics 17 (2010), #R104 6 On zero-sum free subsets of leng...

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

... or (iii) B has all attachments in N ′ 2 ∪N ′ 3 ∪N ′ 4 , and each of N ′ 2 , N ′ 3 and N ′ 4 contains at least one such attachment. Proof of Claim 6: If j = 4 and x 2 and x j are not adjacent, then ... such that at most two pair of them are adjacent. Therefore, no non-edge-bridge can have attachments in more than two N ′ i ’s, and if it has atta chments in two N ′ i ’s, say in N ′ i and in .....

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