Properly Colored Subgraphs and Rainbow Subgraphs in Edge-Colorings with Local Constraints

Random Structures and Algorithms

Volumn 23, Issue 4, 2003, Pages 409-433

  Alon, Noga ^a   Jiang, Tao ^b   Miller, Zevi ^b   Pritikin, Dan ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b MIAMI UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0344287271     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10102     Document Type: Article

References (21)

1. M. Ajtai, J. Komlós, J. Pintz, J. Spencer, and E. Szemerédi, Extremal uncrowded hypergraphs, J Combin Theory Ser A 32 (1982), 321-335.
2. N. Alon, The strong chromatic number of a graph, Random Structures Algorithms 3 (1992), 1-7.
3. N. Alon and G. Gutin, Properly colored Hamiltonian cycles in edge-colored complete graphs, Random Structures Algorithms 11 (1997), 179-186.
4. N. Alon and J. Spencer, The probabilistic method, 2nd edition, Wiley, New York, 2000.
5. N. Alon, H. Lefmann, and V. Rödl, On an anti-Ramsey type result, Colloq Math Soc Janós Bolyai 60, Sets, Graphs and Numbers, Budapest, 1991, pp. 9-22.
6. L. Babai, An anti-Ramsey theorem, Graphs Combinatorics 1 (1985), 23-28.
7. T. Bohman, A. Frieze, R. Martin, M. Ruszinkó, and C. Smyth, Polychromatic cliques and related questions, submitted.
8. B. Bollobás and P. Erdo″s, Alternating Hamiltonian cycles, Israel J Math 23 (1976), 126-131.
9. C. C. Chen and D. E. Daykin, Graphs with Hamiltonian cycles having adjacent lines different colors, J Combin Theory Ser B 21 (1976), 135-139.
10. G. Chen, R. Schelp, and B. Wei, Monochromatic-rainbow Ramsey numbers, 14th Cumberland Conference Abstracts, May 2001, http://www.msci.memphis.edu/balistep/Abstracts.html.
11. R. Duke, H. Lefmann, and V. Rödl, On uncrowded hypergraphs, Random Structures Algorithms 6 (1995), 209-212.
12. P. Erdo″s and R. Rado, A combinatorial theorem, J London Math Soc 25 (1950), 249-255.
13. A. Gyárfás, J. Lehel, R. H. Schelp, and Zs. Tuza, Ramsey numbers for local colorings, Graphs Combinatorics 3 (1987), 267-277.
14. A. Gyárfás, J. Lehel, J. Nešetril, V. Rödl, R. H. Schelp, and Zs. Tuza, Local k-colorings of graphs and hypergraphs, J Combin Theory Ser B 43 (1987), 127-139.
15. R. Jamison, T. Jiang, and A. Ling, Constrained Ramsey numbers, J Graph Theory, to appear.
16. H. Lefmann and V. Rödl, On Erdo″s-Rado numbers, Combinatorica 15(1) (1995), 85-104.
17. M. Molloy and B. Reed, Graph colouring and the probabilistic method, Springer-Verlag, New York, 2001.
18. R. H. Schelp, Local and mean k-Ramsey numbers for complete graphs, J Graph Theory 24 (1997), 201-203.
19. J. Shearer, A property of the colored complete graph, Discrete Math 25 (1979), 175-178.
20. M. Truszczyński and Zs. Tuza, Linear upper bounds for local Ramsey numbers, Graphs Combinatorics 3 (1987), 67-73.
21. D. B. West, Introduction to graph theory (2nd edition), Prentice Hall, Englewood Cliffs, NJ, 2000.