Báo cáo toán học: "Avoiding rainbow induced subgraphs in vertex-colorings" pptx
Báo cáo toán học: "Avoiding rainbow induced subgraphs in vertex-colorings" pptx
... vertices spanning C
4
in G. Color all vertices of U
with color 1 and
rainbow color the remaining vertices with colors {2, . . . , k}. Under this coloring, there is
a rainbow copy of H containing exactly ... with distinct
colors, color the rest of the graph with the remaining colors. Let S induce a rainbow copy
of H in G in this coloring.
Suppose v ∈ S. Since k − 1 non-neighbors...
Báo cáo toán học: "A Rainbow k-Matching in the Complete Graph with r Colors" pdf
... is no rainbow k-matching. (See Figure 2.)
Figure 2: (
2k− 3
2
+ 2 or +3)-Colorings without rainbow k-matchings.
In the coloring (a) of Figure 2, a complete subgraph K
2k− 3
of G is rainbow ... Eroh, Linda: Rainbow Ramsey numbers of stars and matchings, Bull. Inst. Combin.
Appl. 40 (2004), 91–99.
[4] Eroh, Linda: Constrained Ramsey numbers of matchings, J. Combin. Math. Combin.
C...
Báo cáo toán học: " Local equivalence of transversals in matroids" pptx
... transversals of V are in one-to-one
correspondence with the matchings in G covering the part N; and a local replacement
in this language corresponds to changing a single edge in the matching.
Let L be ... the Hamming
graph; two n-tuples being adjacent whenever they differ in only one coordinate. Ev-
ery matroid structure on M determines a subgraph of H inducedonthevertices
correspond...
Báo cáo toán học: "Paths and stability number in digraphs" pptx
... disjoint cliques of size k from G
′
until the remaining subgraph has no clique of size k, and let V
1
, . . . , V
t
be the vertex sets
of t hese disjoint cliques of size k. Since every induced ... contains a stable set of size k.
Note that every directed path in D has at most one vertex in each V
i
. Hence, deleting any
k − 1 directed paths in D leaves at least |D|/k ≥
n
2k
remaining...
Báo cáo toán học: "On rainbow arithmetic progressions" ppsx
... is no dominating color in c.
Let w be the shortest subinterval of I containing all three adjacencies AB, BC, CA.To
simplify the notations, in this subsection we will shift the indexing in such ... each color
class has cardinality at least (n +4)/6 then there is a rainbow AP (3).
In this paper we investigate the conditions on a coloring of {1, ··· ,n} forcing rainbow
AP (3) and pro...
Báo cáo toán học: " On rainbow connection" doc
... Contracting each H
i
to a single vertex we obtain a connected minor of G with
k vertices. This minor has rainbow connection number at most k − 1. We color each
edge connecting vertices in distinct ... another vertex in K \ K
1
.
The resulting coloring makes G rainbow connected and rc(G) ≤ n −δ.
Finally, if k
1
= 1 (and since K
1
K we have k ≥ 2), contract all of K into a single
vert...
Báo cáo toán học: "On rainbow trees and cycles" ppsx
... conditions for the existence of rainbow cycles of all lengths in
edge colourings of complete graphs. We also consider rainbow colorings of a certain
class of trees.
1 Introduction
Let the edges of ... discusses the
existence of rainbow cycles of all sizes. We give a kind of a pancyclic rainbow result.
Theorem 1 There exists an absolute constant c > 0 such that if an edge colourin...
Tài liệu Báo cáo khoa học: The calcium-induced switch in the troponin complex probed by fluorescent mutants of troponin I doc
... naturally occurring
fluorescent amino acids, tyrosine or tryptophan, or the use
of proteins labeled with extrinsic attached probes to analyze
ligand binding, protein–protein interaction and folding
pathways ... Reinach, F.C. (1999) Regulatory properties of
recombinant tropomyosins containing 5-hydroxytryptophan:
Ca
2+
-binding to troponin results in a conformational change in
a region of t...
Báo cáo toán học: " Protection of primary users in dynamically varying radio environment: practical solutions and challenges" pot
... due to increased
interference relative to the method presented in [23]. In [25], this method is improved by
introducing the constraint on the self-interference power level.
An interesting approach ... simple method called window-
ing (W) in the following subsection in greater detail. In the adaptive symbol transition
(AST) method [11], similar to W, the time-domain samples in the...
Báo cáo toán học: " The status of Cantonese in the education policy of Hong Kong" pot
... shopping and dining out, watching TV, listening to the radio,
and taking part in the cultural and recreational activities. Workpl ace activities include
conversations with superiors, subordinates, ... towards
Cantonese teaching in the Chinese curriculum by putting in more resources.
Competing interests declaration
The authors stated that they had no interests which might be perceived as...
Từ khóa: