Skip to main content Accessibility help
×
Home
Hostname: page-component-559fc8cf4f-rz424 Total loading time: 0.263 Render date: 2021-03-07T19:12:42.924Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques

Published online by Cambridge University Press:  19 November 2020

W. T. Gowers
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB3 0WB, UK
Barnabás Janzer
Affiliation:
Department of Pure Mathematics and Mathematical Statistics, Centre for Mathematical Sciences, Wilberforce Road, Cambridge CB3 0WB, UK
Corresponding
E-mail address:
Rights & Permissions[Opens in a new window]

Abstract

Considering a natural generalization of the Ruzsa–Szemerédi problem, we prove that for any fixed positive integers r, s with r < s, there are graphs on n vertices containing $n^{r}e^{-O\left(\sqrt{\log{n}}\right)}=n^{r-o(1)}$ copies of Ks such that any Kr is contained in at most one Ks. We also give bounds for the generalized rainbow Turán problem ex (n, H, rainbow - F) when F is complete. In particular, we answer a question of Gerbner, Mészáros, Methuku and Palmer, showing that there are properly edge-coloured graphs on n vertices with $n^{r-1-o(1)}$ copies of Kr such that no Kr is rainbow.

Type
Paper
Creative Commons
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2020. Published by Cambridge University Press

References

Alon, N., Lefmann, H. and Rödl, V. (1992) On an anti-Ramsey type result. In Sets, Graphs and Numbers (Budapest, 1991), Vol. 60 of Colloquia Mathematica Societatis János Bolyai, pp. 922. North-Holland.Google Scholar
Alon, N., Moitra, A. and Sudakov, B. (2012) Nearly complete graphs decomposable into large induced matchings and their applications. In Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (STOC ’12), pp. 10791090. ACM.CrossRefGoogle Scholar
Alon, N. and Shapira, A. (2006) A characterization of easily testable induced subgraphs. Combin. Probab. Comput. 15 791805.CrossRefGoogle Scholar
Alon, N. and Shapira, A. (2006) On an extremal hypergraph problem of Brown, Erdös and Sós. Combinatorica 26 627645.CrossRefGoogle Scholar
Alon, N. and Shikhelman, C. (2016) Many T copies in H-free graphs. J. Combin. Theory Ser. B 121 146172.CrossRefGoogle Scholar
Behrend, F. A. (1946) On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci. USA 32 331.CrossRefGoogle Scholar
Das, S., Lee, C. and Sudakov, B. (2013) Rainbow Turán problem for even cycles. Europ. J. Combin. 34 905915.CrossRefGoogle Scholar
Ergemlidze, B., Győri, E. and Methuku, A. (2019) On the rainbow Turán number of paths. Electron. J. Combin. 26 P1.17.CrossRefGoogle Scholar
Gerbner, D., Mészáros, T., Methuku, A. and Palmer, C. (2019) Generalized rainbow Turán problems. arXiv:1911.06642Google Scholar
Johnston, D., Palmer, C. and Sarkar, A. (2016) Rainbow Turán problems for paths and forests of stars. Electron. J. Combin. 24 P1.34.Google Scholar
Keevash, P., Mubayi, D., Sudakov, B. and Verstraëte, J. (2007) Rainbow Turán problems. Combin. Probab. Comput. 16 109126.CrossRefGoogle Scholar
Ruzsa, I. Z. and Szemerédi, E. (1979) Triple systems with no six points carrying three triangles. In Combinatorics (Keszthely, 1976), Vol. 18 of Colloquia Mathematica Societatis János Bolyai, pp. 939945. Akadémiai Kaidó.Google Scholar
Sós, V., Erdős, P. and Brown, W. (1973) On the existence of triangulated spheres in 3-graphs, and related problems. Periodica Math. Hungar. 3 221228.Google Scholar

Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 73 *
View data table for this chart

* Views captured on Cambridge Core between 19th November 2020 - 7th March 2021. This data will be updated every 24 hours.

Access
Open access

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *