Abstract
So far in this chapter, we have studied graphs which are defined on sets. Now we start studying (hyper)graphs which are defined on more complex structures. In particular, in this section we study hypergraphs on parameter sets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Deuber, W., Rothschild, B.L., Voigt, B.: Induced partition theorems. J. Comb. Theory A 32, 225–240 (1982)
Erdős, P., Hajnal, A., Máté, A., Rado, R.: Combinatorial Set Theory: Partition Relations for Cardinals. North-Holland, Amsterdam (1984)
Frankl, P., Graham, R.L., Rödl, V.: Induced restricted Ramsey theorems for spaces. J. Comb. Theory A 44, 120–128 (1987)
Prömel, H.J., Voigt, B.: A sparse Graham-Rothschild theorem. Trans. Am. Math. Soc. 309, 113–137 (1988)
Prömel, H.J., Voigt, B.: A short proof of the restricted Ramsey theorem for finite set systems. J. Comb. Theory A 52, 313–320 (1989)
Spencer, J.: Restricted Ramsey configurations. J. Comb. Theory A 19, 278–286 (1975b)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Prömel, H.J. (2013). Hypergraphs on Parameter Sets. In: Ramsey Theory for Discrete Structures. Springer, Cham. https://doi.org/10.1007/978-3-319-01315-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-01315-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01314-5
Online ISBN: 978-3-319-01315-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)