Partitioning by monochromatic trees

Journal of Combinatorial Theory. Series B

Volumn 68, Issue 2, 1996, Pages 218-222

  Maxell, P E ^a   Kohayakawa, Y ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030295272     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1996.0065     Document Type: Article

References (6)

1. 1. P. Erdos, A. Gyárfás, and L. Pyber, Vertex coverings by monochromatic cycles and trees, J. Combin. Theory Ser. B 51 (1991), 90-95.
2. 2. Z. Füredi, Matchings and covers in hypergraphs, Graphs Combin. 4 (1988), 115-206.
3. 3. A. Gyárfás, Partition covers and blocking sets in hypergraphs, MTA SZTAKI Stud. 71 (1977). [In Hungarian]
4. 4. A. Hajnal, P. Komjáth, L. Soukup, and I. Szalkai, Decompositions of edge coloured infinite complete graphs, in "Combinatorics: 7th Hungarian Colloquium, Eger 1987" (A. Hajnal, L. Lovász, and V. T. Sós, Eds.), pp. 277-280, Colloquia Mathematica Societatis János Bolyai, Vol. 52, North-Holland, Amsterdam, 1988.
5. 5. R. Rado, Monochromatic paths in graphs, in "Advances in Graph Theory" (B. Bollobás, Ed.), pp. 191-194, Annals of Discrete Mathematics, Vol. 3, North-Holland, Amsterdam, 1978.
6. 6. Zs. Tuza, Some special cases of Ryser's conjecture (1978), preprint.