Induced trees in triangle-free graphs (Q5901518)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5540946
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Induced trees in triangle-free graphs |
scientific article; zbMATH DE number 5540946 |
Statements
Induced trees in triangle-free graphs (English)
0 references
7 April 2009
0 references
Summary: We prove that every connected triangle-free graph on \(n\) vertices contains an induced tree on \(\exp(c\sqrt{\log n}\,)\) vertices, where \(c\) is a positive constant. The best known upper bound is \((2+o(1))\sqrt n\). This partially answers questions of \textit{P. Erdős}, \textit{M. Saks}, and \textit{V.T. Sós} [J. Comb. Theory, Ser. B 41, 61--79 (1986; Zbl 0603.05023)] and of \textit{A. Pultr} [private communication with the authors; see also \textit{R.N. Ball} and \textit{A. Pultr}, Cah. Topol. Géom. Différ. Catég. 45, No.\,1, 2--22 (2004; Zbl 1062.06020)].
0 references
connected triangle free graph
0 references
number of vertices of an induced tree
0 references
upper bound
0 references
blow-up construction
0 references
0.9925552010536194
0 references
0.9151021242141724
0 references
0.8894215822219849
0 references
0.8204731941223145
0 references
0.8173737525939941
0 references
