Granath, E. and Gyárfás, András and Hardee, J. and Watson, T. and Wu, X. (2018) Ramsey theory on Steiner triples. Journal of Combinatorial Designs, 26 (1). pp. 5-11. ISSN 1063-8539
|
Text
jcdramseyrev2.pdf Download (90kB) | Preview |
Abstract
We call a partial Steiner triple system C (configuration) t-Ramsey if for large enough n (in terms of (Formula presented.)), in every t-coloring of the blocks of any Steiner triple system STS(n) there is a monochromatic copy of C. We prove that configuration C is t-Ramsey for every t in three cases: C is acyclic every block of C has a point of degree one C has a triangle with blocks 123, 345, 561 with some further blocks attached at points 1 and 4 This implies that we can decide for all but one configurations with at most four blocks whether they are t-Ramsey. The one in doubt is the sail with blocks 123, 345, 561, 147. © 2017 Wiley Periodicals, Inc.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Graph theory; T-coloring; Steiner triple systems; Steiner; Combinatorial mathematics; Steiner triples; Ramsey theory |
Subjects: | Q Science / természettudomány > QA Mathematics / matematika Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
SWORD Depositor: | MTMT SWORD |
Depositing User: | MTMT SWORD |
Date Deposited: | 13 Dec 2017 15:35 |
Last Modified: | 13 Dec 2017 15:35 |
URI: | http://real.mtak.hu/id/eprint/71057 |
Actions (login required)
Edit Item |