On an anti-Ramsey type result

@inproceedings{Alon1991OnAA,
  title={On an anti-Ramsey type result},
  author={Noga Alon and Hanno Lefmann and Vojtech R{\"o}dl},
  year={1991}
}
We consider anti-Ramsey type results. For a given coloring ∆ of the k-element subsets of an n-element set X, where two k-element sets with nonempty intersection are colored differently, let inj∆(k, n) be the largest size of a subset Y ⊆ X, such that the kelement subsets of Y are colored pairwise differently. Taking the minimum over all colorings, i.e. inj(k, n) = min∆ {inj∆(k, n)}, it is shown that for every positive integer k there exist positive constants ck, c ∗ k > 0 such that for all… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

An additive problem in different structures, 1990, preprint

V. T. Sós
Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, • 1990

An anti-Ramsey theorem

Graphs and Combinatorics • 1985

Anti - Ramsey theorems , in : Infinite and Finite Sets , ed . by Hajnal , Rado , Sós , Coll

M. Simonovits Erdös, V. T. Sós
Europ . J . Combinatorics • 1985

L . Babai , An anti - Ramsey Theorem

Babai, V. T. Sós
Graphs and Combinatorics • 1985

Anti-Ramsey theorems, in: Infinite and Finite Sets, ed

P. Erdös, M. Simonovits, V. T. Sós
Coll. Math. Soc. Janos Bolyai, North-Holland, • 1975

Similar Papers

Loading similar papers…