Graphs without large triangle free subgraphs (Q1174161)
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 8191
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs without large triangle free subgraphs |
scientific article; zbMATH DE number 8191 |
Statements
Graphs without large triangle free subgraphs (English)
0 references
25 June 1992
0 references
The authors extend results of \textit{P. Erdős} and \textit{C. A. Rogers} [Can. J. Math. 14, 702--707 (1962; Zbl 0194.25304)]. They show that for \(2\leq r<s\) and large enough \(n\), there exist graphs on \(n\) vertices and clique number less than \(s\) in which every set of vertices, which is not too small, spans a clique on \(r\) vertices. Use is made of the theory of random graphs.
0 references
triangle free subgraphs
0 references
clique number
0 references
random graphs
0 references
0.8449268341064453
0 references
0.8042512536048889
0 references
0.8017969131469727
0 references
0.7944823503494263
0 references
