Multicolored subsets in colored hypergraphs

Journal of Combinatorial Theory. Series A

Volumn 74, Issue 2, 1996, Pages 209-248

  Lefmann, Hanno ^a   Rödl, Vojtěch ^b   Wysocka, Beata ^b  

^a TU DORTMUND UNIVERSITY   (Germany)

^b EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030147269     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1996.0049     Document Type: Article

References (13)

1. [AKPSS82] 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. [ALR91] N. ALON, H. LEFMANN, AND V. RÖDL, On an anti-Ramsey type result, Sets, Graphs, and Numbers, Coll. Math. Soc. János Bolyai, Vol. 60, pp. 9-22, North-Holland, Amsterdam, 1991.
3. [Ba85] L. BABAI, An anti-Ramsey theorem, Graphs Combin. 1 (1985), 23-28.
4. [BS85] L. BABAI AND V. T. Sós, Sidon sets in groups and induced subgraphs of Caley graphs, Europ. J. Combin. 6 (1985), 101-114.
5. [Br73] L. M. BRÉGMAN, Some properties of nonnegative matrices and their permanents, Soviet Math. Dokl. 14 (1973), 945-949.
6. [ER50] P. ERDOS AND R. RADO, A combinatorial theorem, J. London Math. Soc. 25 (1950), 249-255.
7. [ESS75] P. ERDOS, M. SIMONOVITS, AND V. T. Sós, Anti-Ramsey theorems, in "Infinite and Finite Sets" (Hajnal, Rado, and Sós, Eds.), Coll. Math. Soc. János Bolyai, pp. 633-643, North-Holland, Amsterdam, 1975.
8. [GI87] C. D. GODSIL AND W. IMRICH, Embedding graphs in Cayley graphs, Graphs and Combin. 3 (1987), 39-43.
9. [FF86] P. FRANKL AND Z. FÜREDI, Union-free families of sets and equations over fields, J. Number Theory 23 (1986), 210-218.
10. [Mi63] H. MINC, Upper bounds for permanents of (0, 1)-matrices, Bull. Amer. Math. Soc. 69 (1963), 789-791.
11. [Ra75] R. RADO, Anti-Ramsey theorems, in "Infinite and Finite Sets" (Hajnal, Rado, and Sós, Eds.), Coll. Math. Soc. János Bolyai, pp. 1159-1168, North-Holland, Amsterdam, 1975.
12. [RS94] V. RÖDL AND E. ŠIŇAJOVÁ, Note on independent sets in Steiner systems, Random Structures and Algor. 5 (1994), 183-190.
13. [So91] V. T. Sós, An additive problem in different structures, in "Proceedings of the Second International Conference, Graph Theory, Combinatorics, Algorithms, and Applications," pp. 486-510, SIAM, Philadelphia, 1991.