𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Large Induced Forests in Triangle-Free Planar Graphs

✍ Scribed by Mohammad R. Salavatipour

Publisher
Springer Japan
Year
2006
Tongue
English
Weight
178 KB
Volume
22
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Large induced forests in sparse graphs
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

Graphs without large triangle free subgr
Graphs without large triangle free subgraphs
✍ B. BollobΓ‘s; H.R. Hind πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 751 KB

Bollobas, B. and H.R. Hind, Graphs without large triangle free subgraphs, Discrete Mathematics 87 (1991) 119-131. The main aim of the paper is to show that for 2 < r <s and large enough n, there are graphs of order n and clique number less than s in which every set of vertices, which is not too sma

Rooted induced trees in triangle-free gr
Rooted induced trees in triangle-free graphs
✍ Florian Pfender πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 68 KB

## Abstract For a graph __G__, let __t__(__G__) denote the maximum number of vertices in an induced subgraph of __G__that is a tree. Further, for a vertex __v__∈__V__(__G__), let __t__(__G, v__) denote the maximum number of vertices in an induced subgraph of __G__that is a tree, with the extra cond