Author:
Burr Stefan A.,Duke Richard A.
Abstract
AbstractWe are interested here in the Ramsey number r(T, C), where C is a complete k-uniform hypergraph and T is a “tree-like” k-graph. Upper and lower bounds are found for these numbers which lead, in some cases, to the exact value for r(T, C) and to a generalization of a theorem of Chváta1 on Ramsey numbers for graphs. In other cases we show that a determination of the exact values of r(T, C) would be equivalent to obtaining a complete solution to existence question for a certain class of Steiner systems.
Publisher
Cambridge University Press (CUP)
Subject
General Mathematics,Statistics and Probability
Reference15 articles.
1. On Ramsey numbers of forests versus nearly complete graphs;Chartrand;Notices Amer. Math. Soc.,1979
2. Admissible parameters for Steiner systems S(t, k, v) with a table for all (v – t)< 498;Kramer;Utilitas Math.,1975
3. On property B and on Steiner systems
4. Tree-complete graph ramsey numbers
5. Ramsey theorems for multiple copies of graphs
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献