Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs (Q2520724): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s11083-015-9384-6 / rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/order/Tomon16 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S11083-015-9384-6 / rank | |||
Normal rank |
Latest revision as of 05:50, 19 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Turán-type results for complete \(h\)-partite graphs in comparability and incomparability graphs |
scientific article |
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