Local anti-Ramsey numbers of graphs

Combinatorics Probability and Computing

Volumn 12, Issue 5-6 SPEC. ISS., 2003, Pages 495-511

  Axenovich, Maria ^a   Jiang, Tao ^b   Tuza, Zsolt ^c  

^a IOWA STATE UNIVERSITY   (United States)

^b MIAMI UNIVERSITY   (United States)

^c INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; FUNCTIONS; MATHEMATICAL MODELS; PROBABILITY; SET THEORY; THEOREM PROVING;

EDGE COLORINGS; RAMSEY NUMBER; SUBGRAPHS;

GRAPH THEORY;

EID: 2942620547     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548303005868     Document Type: Article

References (21)

1. Ahlswede, R., Cai, N. and Zhang, Z. (1992) Rich colorings with local constraints. J. Combin. Inform. System Sci. 17 203-216.
2. Alon, N. (1983) On a conjecture of Erdos, Simonovits and Sós concerning anti-Ramsey theorems. J. Graph Theory 7 91-94.
3. Alon, N. and Gutin, G. (1997) Properly colored Hamiltonian cycles in edge-colored complete graphs. Random Struct. Alg. 11 179-186.
4. Alon, N., Jiang, T., Miller, Z. and Pritikin, D. Properly colored subgraphs and rainbow subgraphs in edge-colorings of complete graphs with local constraints. Submitted.
5. Alon, N., Lefmann, H. and Rödl, V. (1992) On an anti-Ramsey type result. In Sets, graphs and numbers (Budapest, 1991), Vol. 60 of Colloq. Math. Soc. János Bolyai, North-Holland, Amsterdam, p. 9-22.
6. Axenovich, M. and Jiang, T. Anti-Ramsey numbers for small complete bipartite graphs. To appear in Ars Combinatoria.
7. Axenovich, M., Jiang, T. and Kündgen, A. Bipartite anti-Ramsey numbers of cycles and path covers in bipartite graphs. To appear in J. Graph Theory.
8. Bollobás, B. (1978) Extremal Graph Theory, Academic Press, London/New York.
9. Erdos, P., Simonovits, M. and Sós, V. T. (1975) Anti-Ramsey theorems. In Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdos on his 60th birthday), Vol. II, North-Holland, Amsterdam, Vol. 10 of Colloq. Math. Soc. Janos Bolyai, pp. 633-643.
10. Erdos, P. and Simonovits, M. (1966) A limit theorem in graph theory. Studia Sci. Math. Hungar. 1 51-57.
11. Erdos, P. and Stone, A. H. (1946) On the structure of linear graphs. Bull. Amer. Math. Soc. 52 1087-1091
12. Erdos, P. and Tuza, Zs. (1993) Rainbow subgraphs in edge-colorings of complete graphs. Ann. Discrete Math. 55 81-88.
13. Graham, R., Rothschild, B. and Spencer, J. (1990) Ramsey Theory, 2nd edn, Wiley-Interscience Series in Discrete Mathematics and Optimization.
14. Gyárfás, A., Lehel, J., Schelp, R. and Tuza, Zs. (1987) Ramsey numbers for local colorings. Graphs Combin. 3 267-277.
15. Jiang, T. (2002) Edge-colorings with no large polychromatic stars. Graphs Combin. 18.
16. Jiang, T. and West, D. B. On the Erdos-Simonovits-Sós conjecture about the anti-Ramsey number of a cycle. Submitted.
17. Jiang, T. and West, D. B. Edge-colorings of complete graphs that avoid polychromatic trees. To appear in Discrete Math.
18. Lefmann, H., Rödl, V. and Wysocka, B. (1996) Multicolored subsets in colored hypergraphs. J. Combin. Theory Ser. A 74 209-248.
19. Manoussakis, Y., Spyratos, M., Tuza, Zs. and Voigt, M. (1996) Minimal colorings for properly colored subgraphs. Graphs Combin. 12 345-360.
20. n. Combinatorica 4 101-110.
21. Truszczyński, M. and Tuza, Zs. (1987) Linear upper bounds for local Ramsey numbers. Graphs Combin. 3 67-73.