Gyárfás, András (2018) Large sets of t-designs and a Ramsey-type problem. INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY, 18. ISSN 1553-1732
|
Text
s53.pdf Download (238kB) | Preview |
Abstract
For a given r-uniform hypergraph H and for given integers p > q > 0, Rp q (H; r) is the smallest positive integer m such that in every p-coloring of the edges of the complete r-uniform hypergraph Krm there is a copy of H with edges colored by at most q colors. Here we extend some previous results when H = Kr r+1.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 12 Jan 2019 14:38 |
| Last Modified: | 12 Jan 2019 14:38 |
| URI: | http://real.mtak.hu/id/eprint/89777 |
Actions (login required)
 |
Edit Item |
