Báo cáo toán học: "On (δ, χ)-bounded families of graphs" ppsx

... the second author introduced and studied (δ, χ)-bounded families of graphs (under the name of δ-bounded families) in [10]. The so-called color-bound family of graphs mentioned in the related ∗ Research ... orb(C) is (δ, χ)-bounded we may restrict ourselves to bipartite graphs. We shall make use of this result in proving the following theorems. Similar to the concept of...

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

... electronic journal of combinatorics 2 (1995) #R16 3 2Proofs 2.1 Proof of theorem 1 We need a few lemmas before proving theorem 1. Lemma 1 The inequality of theorem 1 holds when n ≤ 6. Proof of lemma 1: Done ... the largest element of the symmetric difference of A and B is in B ). We give a tight upper bound and an asymptotic formula for the size of the shadow of squashed famil...

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

... v ν(Π,P,¯u, v), the number of Π-subposets of P containing v but not u ν(Π,P,u,¯v), the number of Π-subposets of P containing u but not v ν(Π,P,¯u, ¯v), the number of Π-subposets of P containing neither ... particular set of patterns rather than a singleton set. Let Π denote a set of patterns all of the same length k. For any permutation σ of length n let ν(Π,σ) be the numb...

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

... [γ(K m )+1,g A −1], none of the genera admits the genus embedding of any the electronic journal of combinatorics 9 (2002), #R38 25 construction of graph H IB (s, k, l) up through the selection of faces F 1 through ... l)) = 2l +3. Proof: The proof proceeds just as in the proof of Theorem 3.2. For Part (i), the only difference is that here for H IB (s, k, l) we have deleted one edge...

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

... 0, 0 ≤ j ≤ n. Then the solution of (4.4) and (4.5) is bounded if and only if the condition (5.5) is satisfied. Proof. The proof is immediate consequence from proof of Theorem 4.3 with Remark 5.1. Remark ... condition for the boundedness of all solutions of (1.1) and the scalar case of (1.1), respectively. The next result provides a sufficient condition for the boundedness of solution...

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

... for PAPR distri- bution of OFDM/TDM signal and then, we develop the expression for the capacity of OFDM/TDM using MMSE-FDE. A. PAPR of OFDM/TDM The baseband oversampled OFDM/TDM signal given by (2) ... PAPR problem of conventional OFDM at the cost of slight decrease in spect rum efficiency. The capacity of OFDM/ TDM using MMSE-FDE is o btained based on the Gaus- sian assumption o...

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

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

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

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

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