𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertex coverings by monochromatic cycles and trees

✍ Scribed by P Erdős; A Gyárfás; L Pyber

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
346 KB
Volume
51
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex coverings by monochromatic paths
Vertex coverings by monochromatic paths and cycles
✍ A. Gyárfás 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB

We survey some results on covering the vertices of 2-colored complete graphs by t w o paths or by t w o cycles Qf different color. W e show the role of these results i n determining path Ramsey numbers and in algorithms for finding long monochromatic paths or cycles in 2-colored complete graphs. ##

Monochromatic coverings and tree Ramsey
Monochromatic coverings and tree Ramsey numbers
✍ Zsolt Tuza 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 499 KB

Let k = 3 or 4, and let n be a natural number not divisible by k -1. Consider any edge coloring of the complete graph K of order (k-l)(n-1)+2 with k colors. The following facts were known previously: (i) K contains a monochromatic connected subgraph on more than n vertices. (ii) There are k -1 monoc

Multiple vertex coverings by cliques
Multiple vertex coverings by cliques
✍ Wayne Goddard; Michael A. Henning 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

For positive integers m 1 ; . . . ; m k , let f (m 1 ; . . . ; m k ) be the minimum order of a graph whose edges can be colored with k colors such that every vertex is in a clique of cardinality m i , all of whose edges have the ith color for all i ¼ 1; 2; . . . ; k. The value for k ¼ 2 was determin

Partitioning complete multipartite graph
Partitioning complete multipartite graphs by monochromatic trees
✍ Atsushi Kaneko; M. Kano; Kazuhiro Suzuki 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 102 KB

The tree partition number of an r-edge-colored graph G, denoted by t r (G), is the minimum number k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. We determine t 2 (K (n 1 ; n 2 ; . . . ; n k )) of the c