Tight lower bounds on the number of bicliques in false-twin-free graphs (Q5890936): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1510.01165 / rank | |||
Normal rank | |||
Revision as of 12:41, 18 April 2024
scientific article; zbMATH DE number 6639908
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight lower bounds on the number of bicliques in false-twin-free graphs |
scientific article; zbMATH DE number 6639908 |
Statements
Tight lower bounds on the number of bicliques in false-twin-free graphs (English)
0 references
17 October 2016
0 references
bicliques
0 references
false-twin-free graphs
0 references
lower bounds
0 references
