Báo cáo toán học: "Extremal problems for independent set enu

Báo cáo toán học: "Extremal problems for independent set enumeration" ppsx

... I(G) for the set of independent sets in a graph G and i(G) = |I(G)| for the number of independent sets. Much recent research has focused on the problem of maximizing the number of independent sets ... (2011), #P169 4 weighted independent sets. Assign a weight of λ k (for some λ > 0) to an independent set of size k and s et i λ (G) to be the total weight of all independ...

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

17 196 0

Báo cáo toán học: "Extremal problems for t-partite and t-colorable hypergraphs" ppsx

... x j = 0 for some j ∈ {1, 2, . . . , t}. Let a k = |V k |, a j = |V j | and  = x k a j a k /(a j + a k ). Define a new weighting x  by x  v = x v for v ∈ V \(V k ∪ V j ), x  v = /a j for v ... G[P] is covering. Supersaturation for ordinary Turán densities was shown by Erd˝os [E71]. The proof for G-chromatic Turán densities is essentially identical but for completeness we...

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

9 240 0

Báo cáo toán học: " A Recurrence for Counting Graphical Partitions" ppsx

... π  2 − 1, α i = π i+1 − 1 for 1 ≤ i ≤ m and α  i = π  i+1 − 1for1 ≤ i ≤ d(π) − 1. Clearly, f is a bijection between P  (n, k, l)and P(n −k − l +1,k−1,l−1) Furthermore, for 1 ≤ j ≤ d(π), s + j  i=1 (π  i −π i )=(s ... deﬁnition, for t  ≥ t ≥ 0, P(n, k, l, t) ⊆ P (n, k, l, t  ), thus for any s ≥ n, P (n, k, l, n) ⊆ P (n, k, l, s). The result follows since P(n, k, l, s) ⊆ P(n, k,...

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

10 300 0

Báo cáo toán học: "Gray Codes for A-Free Strings" ppsx

... had inﬁnite parity problems, or F(n; A) had no parity problems. Further, for most of the A for which F(n; A) had no parity problems, Gray codes for F(n; A) were constructed for all n ≥ 0. When ... on a Gray code for F(n; A R ). We actually construct Gray codes for the set H(n; C), thus implying Gray codes for F(n)=H(n; ). As in Section 4, the construction of Gray codes fo...

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

29 337 0

Báo cáo toán học: " Existence Theorems for Some Generalized Quasivariational Inclusion Problems" pot

... subset and f : a −→ 2 Y and c : a −→ 2 Y be set- valued maps with nonempty values such that (i) For al l η ∈ a, the set t(η)={x ∈ a : α(f(η),c(x))} is closed in a. (ii) For al l x ∈ a, the set s(x)={η ... compact set a 1 ⊂ a and a compact convex set b ⊂ a such that, for every x ∈ a \ a 1 , there exists η ∈ b with α(f(η),c(x)). Before going further let us introduce some notions...

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

12 268 0

Báo cáo toán học: " Spectrum sensing for cognitive radio exploiting spectrum discontinuities detection" potx

... distributed freely for any purposes (see copyright notice below). For information about publishing your research in EURASIP WCN go to http://jwcn.eurasipjournals.com/authors/instructions/ For information ... netbooks. All this need for ﬂexibility and more “mobile” devices lead to more and more needs to afford the spectral resources that shall be able to satisfy costumers need for mo...