Báo cáo toán học: "On identifying codes in the king grid that are robust against edge deletions" potx
Báo cáo hóa học: "ON EXTRAPOLATION BLOWUPS IN THE L p SCALE" docx
... several imbeddings. As observed earlier at the moment there
is no complete imbedding picture available for all the spaces involved. Two papers should
10 On extrapolation blowups in the L
p
scale
be ... Spaces, then the inclusion X
⊂ Y implies the imbedding X Y (cf.,
e.g., [1]). This particularly applies to al l the spaces in the following—they are al l Banach...
Báo cáo toán học: " On Score Sets in Tournaments" pptx
... Yao, Reid’s conjecture on score sets in tournaments, Kexue Tongbao 33
(1988) 481–484 (in Chinese).
7. T. X. Yao, On Reid’s conjecture of score sets for tournaments, Chinese Sci. Bull.
34 (1989) ... of Reid’s conjecture by pure arithmetical
analysis which appeared in Chinese [6] in 1988 and in English [7] in 1989.
In the following result, we prove that any set of p non...
Báo cáo toán học: "On Kissing Numbers in Dimensions 32 to 128" pptx
... 07 932- 0971, USA
Submitted: April 9, 1998; Accepted: April 13, 1998
ABSTRACT
An elementary construction using binary codes gives new record kissing numbers in dimensions
from 32 to 128.
1. Introduction
Let ... 1,260,230,400 in dimensions 32, 64 and 128, for example).
In contrast, Quebbemann’s lattice Q
32
[14], [5, Chap. 8] has τ = 261,120.
In recent years the kissing...
Báo cáo toán học: "On Catalan Trees and the Jacobian Conjecture" pdf
... 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...
Báo cáo toán học: "Bent Hamilton Cycles in d-Dimensional Grid Graphs" pdf
... the dimension
of joining. Then P must contain w disjoint bent cycles that partition the vertices of P .
Each of these w cycles must contain a wrapped edge in P along the joining dimension.
Further, ... we join the endpoints with red arrows pointing away from each other to create
the new wrapped edges in G + P . We thus obtain a bent Hamilton cycle in Q
(5, 3, 3),
and by repeated...
Báo cáo toán học: "Fans and Bundles in the Graph of Pairwise Sums and Product" potx
... large integers .
Theorem
3.1. The graph G
ì
+
contains -bundles for arbitrarily large integers .Inpar-
ticular, for any positive integer , the graph G
ì
+
contains subgraphs of the following type:
n
n
1
S
S
S
S
S
S
S
S
S
S
S
S
S
S
S
S
S
S
S
S
S
S
S
S
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
k
n
2
M
M
M
M
M
M
M
M
M
M
M
M
M
M
M
M
M
p
p
p
p
p
p
p
p
p
p
p
p
p...
Báo cáo toán học: "On regular factors in regular graphs with small radius" ppsx
... edge-disjoint one factors and the
existence of k -factors in complete multipartite graphs, Discrete Math. 160 (1996)
177–187.
[5] T. Niessen and B. Randerath, Regular factors of simple regular graphs ... Theorems,
Jahresber. Deutsch. Math Verein. 97 (1995) 19–42.
the electronic journal of combinatorics 11 (2004), #R7 7
On regular factors in regular graphs with smal...
Báo cáo toán học: "On Directed Triangles in Digraphs" pps
... the
resulting digraph D
is acyclic.
If true, this conjecture would imply the following strengthening of Lemma 5: Each
digraph D obtained from a tournament by deleting k edges, that has no directed triangles,
has ... with minimum outdegree at
least αn has a directed 3-cycle.
Theorem 3. If β ≥ 0.34564, then each n-vertex digraph D in which both minimum
outdegree and minimum indegree i...
Báo cáo toán học: "On identifying codes in the king grid that are robust against edge deletions" potx
... 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...
Báo cáo toán học: "On Mixed Codes with Covering Radius 1 and Minimum Distance 2" pot
... combinatorics 14 (2007), #R 51 10
Table II. Bounds on K(r, s, s; 2) for r ≤ 16 and 9 ≤ s ≤ 16 .
s = 9 s = 10 s = 11 s = 12 s = 13 s = 14 s = 15 s = 16
r = 1 9 10 11 12 13 14 15 16
r = 2 16 B 18 B 20B ... 71F 72F a85E a96 − 98E a103 − 11 3E 11 0 − 12 6G
r = 13 60 − 65C 66 − 72C 73 − 81F 79 − 84C 85F a98E 10 5 − 11 3E a 117 − 12 8E
r = 14 63 − 67C 70 − 76C 77...
Báo cáo toán học: "On unimodality problems in Pascal’s triangle" potx
... 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...
Báo cáo toán học: "On winning fast in Avoider-Enforcer games" pps
... T. Szab´o, Fast winning strategies in
Avoider-Enforcer games, Graphs Combin., 25 (2009), 533–544.
[7] D. Hefetz, M. Krivelevich, M. Stojakovi´c and T. Szab´o, Fast winning strategies in
Maker-Breaker ... later
Hefetz et al. [7] studied the fast winning in Maker-Breaker Hamiltonicity game.
We would like to emphasize that, generally speaking, results on fast winning in...
Báo cáo toán học: "On some densities in the set of permutations" ppsx
... 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...
Từ khóa: