Multicolored trees in complete graphs

Journal of Graph Theory

Volumn 54, Issue 3, 2007, Pages 221-232

  Akbari, S ^a,b   Alipour, A ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^b INSTITUTE FOR STUDIES IN THEORETICAL PHYSICS AND MATHEMATICS IPM   (Iran)

Author keywords

Complete graph; Multicolored tree; Rado's theorem

Indexed keywords

COLOR; GRAPH THEORY; PROBABILITY DISTRIBUTIONS;

COMPLETE GRAPH; MULTICOLORED TREE; RADO'S THEOREM;

TREES (MATHEMATICS);

EID: 33847751053     PISSN: 03649024     EISSN: 10970118     Source Type: Journal    
DOI: 10.1002/jgt.20204     Document Type: Article

References (17)

1. N. Alon, R. A. Brualdi, and B. L. Shader, Multicolored forests in bipartite decompositions of graphs, J Combin Theory Ser B 53(1) (1991), 143-148.
2. N. Alon and M. Tarsi, Colorings and orientations of graphs, Combinatorica 12 (1992), 125-134.
3. A. Bialostocki and W. Voxman, On the anti-Ramsey numbers for spanning trees, Bull Inst Comb Appl 32 (2001), 23-26.
4. N. Biggs, "Algebraic Graph Theory," Cambridge University Press, Cambridge, 1993.
5. R. A. Brualdi and S. Hollingsworth, Multicolored trees in complete graphs, J Combin Theory Ser B 68 (1996), 310-313.
6. W. Chan, An exchange property of matroid, Discrete Math 146 (1995), 299-302.
7. G. M. Constantine, Multicolored parallelisms of isomorphic spanning trees, Discrete Math Theor Comput Sci 5(1) (2002), 121-125.
8. A. A. Drisko, On the number of even and odd latin squares of order p + 1, Adv Math 128 (1997), 20-35.
9. rp, The Electron J Combin 5(1) (1998), Research paper 28.
10. P. Erdös, M. Simonovits, and V. T. Sós, Anti-Ramsey theorems. Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdös on his 60th birthday), Vol. II, pp. 633-643. Colloq. Math. Soc. Janos Bolyai, Vol. 10, North-Holland, Amsterdam, 1975.
11. T. Jiang, Edge colorings with no large polychromatic stars, Graphs Combin 18 (2002), 303-308.
12. T. Jiang and D. B. West, Edge-colorings of complete graphs that avoid polychromatic trees, Discrete Math 274(1-3) (2004), 137-145.
13. 2n, Ars Combin 57 (2000), 77-82.
14. S. Onn, A colorful determinantal identity, a conjecture of Rota, and latin squares, Amer Math Monthly 104 (1997), 156-159.
15. W. D. Wallis, "Combinatorial Designs," Monographs and Textbooks in Pure and Applied Mathematics, 118, Marcel Dekker, Inc., New York, 1988.
16. D. J. A. Welsh, "Matroid Theory," Academic Press, London, 1976.
17. D. B. West, "Introduction to Graph Theory," Prentice-Hall, Upper Saddle River, NJ, 2001.