Báo cáo toán học: "All regular multigraphs of even order and high degree are 1-factorable" docx
Báo cáo toán học: " Near optimal bound of orthogonal matching pursuit using restricted isometric constant" docx
... θ
|I
1
|,|I
2
|
x
2
.
6
Nea
r optimal bound of orthogonal matching pursuit using
restricted isometric constant
Jian Wang, Seokbeop Kwon and Byonghyo Shim
∗
School of Information and Communication, ... formatted
PDF and full text (HTML) versions will be made available soon.
Near optimal bound of orthogonal matching pursuit using restricted isometric
c...
Báo cáo toán học: "On the Continuity of Julia Sets and Hausdorff Dimension of Polynomials" ppsx
... study the continuity of Julia set of some rational maps and the stability
of the Hausdorff dimension of the Julia set of polynomials
z
d
+ c (d ≥ 2)forsome
semi-hyperbolic parameters
c in the boundary ... Vietnam Journal of Mathematics 33:3 (2005) 283–289
On the Continuity of Julia Sets and
Hausdorff Dimension of Polynomials
Zhuang Wei
Institu...
Báo cáo toán học: "The Last Digit of 2n n and n 2n−2i i n−i" ppsx
... g
n
is divisible by 5 if and only if (4
n
− 1)
2n
n
is divisible
by 5. And since g
n
is odd, g
n
mod 10 = 5 if and only if g
n
is divisible by 5.
4
n
−1 is divisible by 5 if and only if n is ... +(
1
4
)
2
4
2
5
2
z
2
+···].
Hence,
f
n
=
1
4
n
i= 0
2i
i
2n − 2i
n − i
5
i
,
and
g
n
=
1
4
n
i= 0
2i
i
2n − 2i
n...
Báo cáo toán học: "Recognizing circulant graphs of prime order in polynomial time" doc
... Recognizing circulant graphs of prime
order in polynomial time
∗
Mikhail E. Muzychuk
Netanya Academic College
42365 Netanya, Israel
mikhail@netvision.net.il
Gottfried Tinhofer
Technical University of ... W of indices write A
W
for the submatrix of A consisting of
all rows and columns index with elements of W . It is easy to see by inspection that
each of the blocks A...
Báo cáo toán học: "On the number of perfect matchings and Hamilton cycles in -regular non-bipartite graphs" ppsx
... n)k
−1
φ(k).
In either case, the inequality in part 1 of the lemma holds.
On the number of perfect matchings and Hamilton
cycles in -regular non-bipartite graphs
Alan Frieze
∗
Department of Mathematical ... of combinatorics 7 (2000), #R57 4
3 Hamilton Cycles
A Hamilton cycle is the union of two perfect matchings and so h(G) ≤
1
2
m(G)
2
a...
Báo cáo toán học: "All regular multigraphs of even order and high degree are 1-factorable" docx
... 1-factors of G. This gives a decomposition of the edges of G into 2r 1-factors of
G,a(k + 1) -regular simple graph, and (r − 1) k -regular simple graphs.
3 1-factorization of regular multigraphs of even ... ,
r
2
are Hamilton cycles of G, F
1
,F
2
, ,F
(r−1)
are
1-factors of G, F is a simple (k +1)-factor of G,andS
1
,S
2
, ,S
(r−1)
are k -regular simple...
Báo cáo toán học: "On the orbits of Singer groups and their subgroups" pot
... orbits of Singer
groups or subgroups of Singer groups. It seems, however, that only point (and, in the case
the electronic journal of combinatorics 9 (2002), #R15 8
orbits of any Singer cycle of Σ
n−1
on ...
In the statement of the following theorem, à denotes the Măobius function, the basic
properties of which can be found in, for example, [1].
Theore...
Báo cáo toán học: "On the number of possible row and column sums of 0,1-matrices" pps
... x and y to be row and column sums of a matrix
is that they have the same weight.
Clearly, the row sums of a member of M are at most n.Conversely,ifx =(x
1
, ,x
m
)
and 0 x
i
n,letR = R(x)bethem ... (5)
the electronic journal of combinatorics 13 (2006), #N8 5
3 Start of the proof
Let N = {0, 1, }. Define the weight of a matrix N to be the sum of its e...
Báo cáo toán học: "The Generating Function of Ternary Trees and Continued Fractions" doc
... proof of this symmetry will induce a
bijective proof of N(i, j)=N(j, i), and then a bijective proof of Lemma 6.4.
Proof of Theorem 6.3. Let G(m, n)bethenumberofK-paths starting at (−2m, −2m)
and ... negative, and the
verification of the recurrence is straightforward. (We will give another proof of (48) in
Example 9.2.) This completes the proof of (7).
For equation (8), we n...
Báo cáo toán học: "New regular partial difference sets and strongly regular graphs with parameters (96,20,4,4) and (96,19,2,4)" ppsx
... Algorithms, and Programming, Version
4.3; Aachen, St. Andrews (1999).
the electronic journal of combinatorics 13 (2006), #R88 10
New regular partial difference sets and strongly regular
graphs with parameters ... partial difference sets S
1
and S
2
in a group H, the graphs Cay(H, S
1
) and Cay(H, S
2
) can be isomorphic. Similarly, for
two inequivalent partia...
Báo cáo toán học: "Uniquely Hamiltonian Characterizations of Distance-Hereditary and Parity Graphs" ppsx
... 417–420.
the electronic journal of combinatorics 15 (2008), #N36 5
Uniquely Hamiltonian Characterizations
of Distance-Hereditary and Parity Graphs
Terry A. McKee
Department of Mathematics & Statistics
Wright ... H is an induced
subgraph of G and so has an even number of hamiltonian cycles. Suppose v
is the twin of
some v ∈ V (G). If v
∈ V (H), then H has an...
Báo cáo toán học: "The Ramsey number of diamond-matchings and loose cycles in hypergraphs" potx
... p
l
} and we join vertices x and
the electronic journal of combinatorics 15 (2008), #R126 10
The Ramsey number of diamond-matchings and
loose cycles in hypergraphs
Andr´as Gy´arf´as
∗
Computer and ... [12]) and t = 2 (Alon and Frankl [1] and Gy´arf´as
[13]).
Next we state and prove the Ramsey- type form of our main result, it determines the
exact value of...
Từ khóa: