<i>K<sup>s</sup></i>-Free Graphs Without Large <i>K<sup>r</sup></i>-Free Subgraphs (Q4314152): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Graphs without large triangle free subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Turan's theorem for sparse graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Local constraints ensuring small representing sets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimum number of elements of representing a set system of given rank / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Construction of Certain Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Local and global clique numbers / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0963548300001243 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2254576550 / rank | |||
Normal rank | |||
Latest revision as of 10:38, 30 July 2024
scientific article; zbMATH DE number 690972
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | <i>K<sup>s</sup></i>-Free Graphs Without Large <i>K<sup>r</sup></i>-Free Subgraphs |
scientific article; zbMATH DE number 690972 |
Statements
<i>K<sup>s</sup></i>-Free Graphs Without Large <i>K<sup>r</sup></i>-Free Subgraphs (English)
0 references
9 April 1995
0 references
upper bound
0 references
Lovász Local Lemma
0 references
exponential correlation inequality
0 references
