Brightwell, Graham and Panagiotou, Konstantinos and Steger, Angelika
(2009)
*Extremal subgraphs of random graphs: an extended version.*
arXiv.

## Abstract

We prove that there is a constant $c >0$, such that whenever $p \ge n^{-c}$, with probability tending to 1 when $n$ goes to infinity, every maximum triangle-free subgraph of the random graph $G_{n,p}$ is bipartite. This answers a question of Babai, Simonovits and Spencer (Journal of Graph Theory, 1990). The proof is based on a tool of independent interest: we show, for instance, that the maximum cut of almost all graphs with $M$ edges, where $M >> n$, is ``nearly unique''. More precisely, given a maximum cut $C$ of $G_{n,M}$, we can obtain all maximum cuts by moving at most $O(\sqrt{n^3/M})$ vertices between the parts of $C$.

Item Type: | Monograph (Other) |
---|---|

Official URL: | http://arxiv.org/ |

Additional Information: | © 2009 The authors |

Subjects: | Q Science > QA Mathematics |

Sets: | Departments > Mathematics |

Date Deposited: | 09 Apr 2010 14:20 |

Last Modified: | 12 Apr 2012 11:47 |

URI: | http://eprints.lse.ac.uk/id/eprint/27676 |

### Actions (login required)

View Item |