Extremal subgraphs of random graphs

László Babai, M. Simonovits, Joel Spencer

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

We shall prove that if L is a 3‐chromatic (so called “forbidden”) graph, and —Rn is a random graph on n vertices, whose edges are chosen independently, with probability p, and —Bn is a bipartite subgraph of Rn of maximum size, —Fn is an L‐free subgraph of Rn of maximum size, then (in some sense) Fn and Bn are very near to each other: almost surely they have almost the same number of edges, and one can delete Op(1) edges from Fn to obtain a bipartite graph. Moreover, with p = 1/2 and L any odd cycle, Fn is almost surely bipartite.

Original languageEnglish
Pages (from-to)599-622
Number of pages24
JournalJournal of Graph Theory
Volume14
Issue number5
DOIs
Publication statusPublished - 1990

Fingerprint

Random Graphs
Subgraph
Odd Cycle
Bipartite Graph
Graph in graph theory

ASJC Scopus subject areas

  • Geometry and Topology

Cite this

Extremal subgraphs of random graphs. / Babai, László; Simonovits, M.; Spencer, Joel.

In: Journal of Graph Theory, Vol. 14, No. 5, 1990, p. 599-622.

Research output: Contribution to journalArticle

Babai, László ; Simonovits, M. ; Spencer, Joel. / Extremal subgraphs of random graphs. In: Journal of Graph Theory. 1990 ; Vol. 14, No. 5. pp. 599-622.
@article{f4f75946320b4bb49e54104a769ace53,
title = "Extremal subgraphs of random graphs",
abstract = "We shall prove that if L is a 3‐chromatic (so called “forbidden”) graph, and —Rn is a random graph on n vertices, whose edges are chosen independently, with probability p, and —Bn is a bipartite subgraph of Rn of maximum size, —Fn is an L‐free subgraph of Rn of maximum size, then (in some sense) Fn and Bn are very near to each other: almost surely they have almost the same number of edges, and one can delete Op(1) edges from Fn to obtain a bipartite graph. Moreover, with p = 1/2 and L any odd cycle, Fn is almost surely bipartite.",
author = "L{\'a}szl{\'o} Babai and M. Simonovits and Joel Spencer",
year = "1990",
doi = "10.1002/jgt.3190140511",
language = "English",
volume = "14",
pages = "599--622",
journal = "Journal of Graph Theory",
issn = "0364-9024",
publisher = "Wiley-Liss Inc.",
number = "5",

}

TY - JOUR

T1 - Extremal subgraphs of random graphs

AU - Babai, László

AU - Simonovits, M.

AU - Spencer, Joel

PY - 1990

Y1 - 1990

N2 - We shall prove that if L is a 3‐chromatic (so called “forbidden”) graph, and —Rn is a random graph on n vertices, whose edges are chosen independently, with probability p, and —Bn is a bipartite subgraph of Rn of maximum size, —Fn is an L‐free subgraph of Rn of maximum size, then (in some sense) Fn and Bn are very near to each other: almost surely they have almost the same number of edges, and one can delete Op(1) edges from Fn to obtain a bipartite graph. Moreover, with p = 1/2 and L any odd cycle, Fn is almost surely bipartite.

AB - We shall prove that if L is a 3‐chromatic (so called “forbidden”) graph, and —Rn is a random graph on n vertices, whose edges are chosen independently, with probability p, and —Bn is a bipartite subgraph of Rn of maximum size, —Fn is an L‐free subgraph of Rn of maximum size, then (in some sense) Fn and Bn are very near to each other: almost surely they have almost the same number of edges, and one can delete Op(1) edges from Fn to obtain a bipartite graph. Moreover, with p = 1/2 and L any odd cycle, Fn is almost surely bipartite.

UR - http://www.scopus.com/inward/record.url?scp=84986469590&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84986469590&partnerID=8YFLogxK

U2 - 10.1002/jgt.3190140511

DO - 10.1002/jgt.3190140511

M3 - Article

AN - SCOPUS:84986469590

VL - 14

SP - 599

EP - 622

JO - Journal of Graph Theory

JF - Journal of Graph Theory

SN - 0364-9024

IS - 5

ER -