✦ LIBER ✦

On large induced trees and long induced paths in sparse random graphs

✍ Scribed by W.C.Stephen Suen

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 697 KB
Volume: 56
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90021-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Large induced trees in sparse random gra

Large induced trees in sparse random graphs

✍ A.M Frieze; B Jackson 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 621 KB

Maximal induced trees in sparse random g

Maximal induced trees in sparse random graphs

✍ Tomasz łuczak; Zbigniew Palka 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 493 KB

A study of the orders of maximal induced trees in a random graph G, with small edge probability p is given. In particular, it is shown that the giant component of almost every G,, where p = c/n and c > 1 is a constant, contains only very small maximal trees (that are of a specific type) and very lar

The largest induced tree in a sparse ran

The largest induced tree in a sparse random graph

✍ W. Fernandez de la Vega 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB 👁 2 views

The author proved that, for c > 1, the random graph G(n, p ) on n vertices with edge probability p = c / n contains almost always an induced tree on at least q n ( 1 -o( 1)) vertices, where L Y ~ is the positive root of the equation CLY = log( 1 + c'a). It is shown here that if c is sufficiently lar

Large induced forests in sparse graphs

✍ Noga Alon; Dhruv Mubayi; Robin Thomas 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 148 KB

## Abstract For a graph __G__, let __a__(__G__) denote the maximum size of a subset of vertices that induces a forest. Suppose that __G__ is connected with __n__ vertices, __e__ edges, and maximum degree Δ. Our results include: (a) if Δ ≤ 3, and __G__ ≠ __K__~4~, then __a__(__G__) ≥ __n__ − e/4 − 1

Subdivisions of large complete bipartite

Subdivisions of large complete bipartite graphs and long induced paths in k-connected graphs

✍ Thomas Böhme; Bojan Mohar; Riste Škrekovski; Michael Stiebitz 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB 👁 1 views

## Abstract It is proved that for every positive integers __k__, __r__ and __s__ there exists an integer __n__ = __n__(__k__,__r__,__s__) such that every __k__‐connected graph of order at least __n__ contains either an induced path of length __s__ or a subdivision of the complete bipartite graph __

Some results on graphs without long indu

Some results on graphs without long induced paths

✍ Dong, Jinquan 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 2 views

Let I(t) be the set of integers with the property that in every Pt-free connected graph G, the i-center C,(G) induces a connected subgraph. What is the minimum element of /(t)? In this paper, we prove that this minimum is [2t/3] -1 if t = 0 or Z(mod3) and is [ 2 t / 3 ] otherwise. Furthermore, as co