𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Excluding induced subgraphs II: extremal graphs

✍ Scribed by H.J. Prömel; A. Steger

Book ID
104184500
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
751 KB
Volume
44
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal subgraphs for two graphs
Extremal subgraphs for two graphs
✍ F.R.K Chung; P Erdös; J Spencer 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 564 KB
Extremal subgraphs of random graphs
Extremal subgraphs of random graphs
✍ Graham Brightwell; Konstantinos Panagiotou; Angelika Steger 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 698 KB
Extremal subgraphs of random graphs
Extremal subgraphs of random graphs
✍ László Babai; Miklós Simonovits; Joel Spencer 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 1015 KB

## Abstract We shall prove that if __L__ is a 3‐chromatic (so called “forbidden”) graph, and —__R__^__n__^ is a random graph on __n__ vertices, whose edges are chosen independently, with probability __p__, and —__B__^__n__^ is a bipartite subgraph of __R__^__n__^ of maximum size, —__F__^__n__^ is a

Extremal graphs with bounded densities o
Extremal graphs with bounded densities of small subgraphs
✍ Griggs, Jerrold R.; Simonovits, Mikl�os; Thomas, George Rubin 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB 👁 1 views

Let Ex(n, k, µ) denote the maximum number of edges of an n-vertex graph in which every subgraph of k vertices has at most µ edges. Here we summarize some known results of the problem of determining Ex(n, k, µ), give simple proofs, and find some new estimates and extremal graphs. Besides proving new

Extremal bipartite subgraphs of cubic tr
Extremal bipartite subgraphs of cubic triangle-free graphs
✍ Glenn Hopkins; William Staton 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 275 KB

## Abstract A cubic triangle‐free graph has a bipartite subgraph with at least 4/5 of the original edges. Examples show that this is a best possible result.