Báo cáo toán học: "A note on circuit graphs" pot

... note on the almost sure limit theorem for self-normalized partial sums of random variables in the domain of attraction of the normal law Qunying Wu 1,2 1 College of Science, Guilin University of ... sequence of independent and identically distributed random variables in the domain of attraction of a normal distribution. A...

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, 15:20

... class="bi x0 y1 w2 h 2" alt =""

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

... any nonhamiltonian Burkard–Hammer graph is contained in a maximal nonhamil- tonian Burkard–Hammer graph. So knowledge about maximal nonhamiltonian Burkard–Hammer graphs provides us certain information about nonhamiltonian Burkard–Hammer ... assume that all con- sidered in this paper maximal nonhamiltonian Burkard–Hammer graphs G = S(I ∪ K, E)haveδ(G)=|I|−k where |I|≥k...

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

... need only show that no prefix of m n is an overlap. First note that no prefix of m n is a square of length 12 or greater; otherwise the prefix of m n of length 6 reappears internally, i.e. m n contains ... m j , a contradiction since m j is overlap-free. Since aab is a prefix of m i ,f(aab)=aaf(b)isaprefixofm j . However, another prefix of m j is aabaab. Thus one of f (b)andbaab i...

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

... the reflection representation of a finite Coxeter group. This is essentially what we are looking at. (The defining representation of S n consists of the direct sum of the reflection representation ... have: Proposition 1.2. dim F n = D(n). Proof. Consider the table of the characters χ N ; we are interested in the dimension of the row-span of this table. Since t...

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

... A Note on Sparse Random Graphs and Cover Graphs ∗ Tom Bohman † Alan Frieze ‡ Mikl´os Ruszinko Đ Lubos Thoma ả Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, ... a constant κ<2/3, then it outputs a cover graph whp. Note that the output graph will have whp girth equal to 4. On a related note we point to [8] which surveys constructions of no...

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

... sharp estimates obtained by Kamath et al. of the probability that no bin is empty after the random placement of the balls and exploiting the relationship between the placement of balls and the rigid ... A note on the non-colorability threshold of a random graph Alexis C. Kaporis, Lefteris M. Kirousis, and Yannis C. Stamatiou University of Patras Departm...

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

... is (k, )-sum-free for k,  ∈ N, k>,ifthere are no solutions to the equation x 1 + ···+ x k = y 1 + ···+ y  in A. Denote by SF n k, the number of (k, )-sum-free subsets of [1,n]. Since the ... ρ). The main result of this note says that if (k − )/ is small in terms of ρ, then the number of (k, )-sum-free subsets of [1,n]isequalto(ϕ(ρ)+ϕ r...

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

... with b fixed, for < /b> various ranges of < /b> k. For < /b> purposes of < /b> comparison, we repeat these results below. Theorem 1 The < /b> distribution of < /b> the < /b> height of < /b> b- tries < /b> has the < /b> following asymptotic < /b> expan- sions for < /b> ... u − 1=O (b −1/2 ). We thus set u =1+x/ √ b and obtain I = e b b b+ 1 b!  B − √ b exp  b  lo...

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

... graphs without short cycles, Colloq. Math. Soc. Janos Bolyai 60 (1991) 727–732. the electronic journal of combinatorics 16 (2009), #N30 3 A note on packing graphs without cycles of length up to ... (xσ ′ (v))(yσ ′ (w))σ ′ is a packing of G. Thus we get a contradiction. Assume now that G ′ − U is a star (with at least one edge). Note that since G has no cycle...

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

... Perkins and P. Rowley. Commuting Involution Graphs for Symmetric Groups, J. Algebra 266(2003), no. 1, 133-153. [2] C. Bates, D. Bundy, S. Perkins and P. Rowley. Commuting Involution Graphs in Finite ... encoded in x -graphs (see Lemma 2.3 and Proposition 3.6 in [1] for more de- tails). For further recent work on commuting graphs we direct the reader to [2], [3] and [4]....

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

... Classifications: 05C38, 05C40 Abstract We give a short proof of Gao and Richter’s th eorem that every circuit graph contains a closed walk visiting each vertex once or twice. 1 Introduction We only consider ... A note on circuit graphs Qing Cui Department of Mathematics Nanjing University of Aeronautics and Astronautics Nanjing 210016, P. R. China cui@nuaa.edu.cn Submitted: ... and Ric...

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

... of 3-trees in circuit graphs. (They also proved similar results for 3-connected graphs that the electronic journal of combinatorics 17 (2010), #N10 3 A note on circuit graphs Qing Cui Department ... of Gao and Richter’s th eorem that every circuit graph contains a closed walk visiting each vertex once or twice. 1 Introduction We only consider finite graphs without loops or...

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