Home
Hostname: page-component-55597f9d44-jzjqj Total loading time: 0.492 Render date: 2022-08-14T09:56:16.436Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

# The Turán Theorem for Random Graphs

Published online by Cambridge University Press:  19 January 2004

## Abstract

The aim of this paper is to prove a Turán-type theorem for random graphs. For $\gamma >0$ and graphs $G$ and $H$, write $G\to_\gamma H$ if any $\gamma$-proportion of the edges of $G$ spans at least one copy of $H$ in $G$. We show that for every graph $H$ and every fixed real $\delta>0$, almost every graph $G$ in the binomial random graph model $\cG(n,q)$, with $q=q(n)\gg((\log n)^4/n)^{1/d(H)}$, satisfies $G\to_{(\chi(H)-2)/(\chi(H)-1)+\delta}H$, where as usual $\chi(H)$ denotes the chromatic number of $H$ and $d(H)$ is the ‘degeneracy number’ of $H$.

Since $K_l$, the complete graph on $l$ vertices, is $l$-chromatic and $(l-1)$-degenerate, we infer that for every $l\geq2$ and every fixed real $\delta>0$, almost every graph $G$ in the binomial random graph model $\cG(n,q)$, with $q=q(n)\gg((\log n)^4/n)^{1/(l-1)}$, satisfies $G\to_{(l-2)/(l-1)+\delta}K_l$.

Type
Paper
Information
Combinatorics, Probability and Computing , January 2004 , pp. 61 - 91

## Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)
19
Cited by

# Save article to Kindle

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved 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.

The Turán Theorem for Random Graphs
Available formats
×

# Save article to Dropbox

To save 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 used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

The Turán Theorem for Random Graphs
Available formats
×

# Save article to Google Drive

To save 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 used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

The Turán Theorem for Random Graphs
Available formats
×
×