\(K_4\)-free graphs without large induced triangle-free subgraphs (Q2250854)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: K₄-free graphs without large induced triangle-free subgraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(K_4\)-free graphs without large induced triangle-free subgraphs |
scientific article |
Statements
\(K_4\)-free graphs without large induced triangle-free subgraphs (English)
0 references
21 July 2014
0 references
For natural numbers \(r\), \(s\) and \(n\), let \(f_{r,s}(n)\) be the largest integer \(m\) such that every \(K_s\)-free subgraph of order \(n\) contains an induced \(K_r\)-free subgraph of order \(m\). The author presents an upper bound for \(f_{3,4}(n)\), and determines \(\ln f_{3,4}(n)\) asymptotically.
0 references
triangle-free subgraph
0 references
random graphs
0 references
probabilistic method
0 references
0.8495105504989624
0 references
0.8492076396942139
0 references
0.8394048810005188
0 references
0.8208383917808533
0 references
0.8029857873916626
0 references
