|
|||||
|
|
Density theorems and extremal hypergraph problems |
|
| Authors: | V Rödl E Tengan M Schacht N Tokushige |
| Institution: | 1. Department of Mathematics and Computer Science, Emory University, 30322, Atlanta, GA, USA 2. Institut für Informatik, Humboldt Universit?t zu Berlin, Unter den Linden 6, 10099, Berlin, Germany 3. College of Education, Ryukyu University, Nishihara, 903-0213, Okinawa, Japan |
| Abstract: | We present alternative proofs of density versions of some combinatorial partition theorems originally obtained by E. Szemerédi, H. Furstenberg and Y. Katznelson. These proofs are based on an extremal hypergraph result which was recently obtained independently by W. T. Gowers and B. Nagle, V. Rödl, M. Schacht, J. Skokan by extending Szemerédi’s regularity lemma to hypergraphs. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |