Linear Ramsey Numbers for Bounded-Degree Hypergrahps

Electronic Notes in Discrete Mathematics

Volumn 29, Issue SPEC. ISS., 2007, Pages 47-51

  Ishigami, Yoshiyasu ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

Author keywords

hypergraph; quasirandomness; Ramsey theory; regularity lemma

Indexed keywords

EID: 34547660411     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2007.07.009     Document Type: Article

References (14)

1. Burr S.A., and Erdo{combining double acute accent}s P. On the magnitude of generalized Ramsey numbers for graphs. Infinite and finite sets, Vol. 1. Colloq. Math. Soc. János Bolyai Vol. 10 (1975), North-Holland, Amsterdam 215-240
2. Chvátal V., Rödl V., Szemerédi E., and Trotter Jr. W.T. The Ramsey number of a graph with bounded maximum degree. J. Combin. Theory Ser. B 34 (1983) 239-243
3. Chvátal V., and Szemerédi E. On the Erdo{combining double acute accent}s-Stone theorem. J. London Math. Soc. 23 2 (1981) 207-214
4. Cooley O., Fountoulakis N., Köhn D., and Osthus D. 3-uniform hypergraphs of bounded degree have linear ramsey numbers. preprint (2006). arXiv:math/0608442
5. Cooley O., Fountoulakis N., Köhn D., and Osthus D. Embeddings and ramsey numbers of sparse k-uniform hypergraphs. preprint (2006). arXiv:math/0612351
6. Ishigami Y. Proof of a conjecture of Bollobás and Kohayakawa on the Erdo{combining double acute accent}s-Stone theorem. J. Combin. Theory Ser. B 85 (2002) 222-254
7. Ishigami Y. Linear ramsey numbers for bounded-degree hypergraphs. preprint (2006). arXiv:math/0612601
8. Ishigami Y. Removal lemma for infinitely-many forbidden hypergraphs and property testing. preprint (2006). arXiv:math/0612669
9. Ishigami Y. A simple regularization of hypergraphs. preprint (2006). arXiv:math/0612838
10. Komlós J., Shokoufandeh A., Simonovits M., and Szemerédi E. The regularity lemma and its applications in graph theory. Theoretical aspects of computer science. Lecture Notes in Comput. Sci. 2292 (2002), Springer, Berlin 84-112
11. Kostochka A.V., and Rödl V. On Ramsey numbers of uniform hypergraphs with given maximum degree. J. Combin. Theory Ser. A 113 (2006) 1555-1564
12. Nagle, B., S. Olsen, V. Rödl and M. Schacht, On the ramsey number of sparse 3-graphs, preprint (2006)
13. Ramsey F. On a problem of formal logic. Proc. Lond. Math. Soc. 30 2 (1930) 264-286
14. Rödl, V. and M. Schacht, Regular partitions of hypergraphs, Combinatorics, Probability & Computing, to appear (2006)