✦ LIBER ✦

Extremal subgraphs for two graphs

✍ Scribed by F.R.K Chung; P Erdös; J Spencer

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 564 KB
Volume: 38
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(85)90070-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Extremal graphs for homomorphisms

✍ Jonathan Cutler; A. J. Radcliffe 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

The study of graph homomorphisms has a long and distinguished history, with applications in many areas of graph theory. There has been recent interest in counting homomorphisms, and in particular on the question of finding upper bounds for the number of homomorphisms from a graph G into a fixed imag

Extremal Digraph Results for Topological

Extremal Digraph Results for Topological Complete Subgraphs

✍ C. Jagger 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 143 KB

We determine, to within a constant factor, the maximum size of a digraph that does not contain a topological complete digraph DK p of order p. Let t 1 ( p) be defined for positive p by where D denotes a digraph. We show that 1 16 p 2 < t 1 ( p) ≤ 44 p 2 . We also obtain results for containing topol

An Extremal Result for Subgraphs with Fe

An Extremal Result for Subgraphs with Few Edges

✍ S. Brandt 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 427 KB

We prove that whenever the edge number of a graph of order \(n \geqslant 517\) ensures that it contains every complete graph and every forest with at most \(n\) vertices and at most \(m\) edges, then the graph contains every graph with at most \(n\) vertices and \(m\) edges if \(m<n\). The required