Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs (Q2520724)
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 6664964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs |
scientific article; zbMATH DE number 6664964 |
Statements
Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs (English)
0 references
16 December 2016
0 references
poset
0 references
Dilworth's theorem
0 references
bipartite graph
0 references
Turan problem
0 references
0.88215065
0 references
0.86973166
0 references
0.8665619
0 references
0.8649501
0 references
0.8648935
0 references
0.85768116
0 references
