On convex geometric graphs with no \(k+1\) pairwise disjoint edges (Q503641): 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/s00373-016-1719-6 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00373-016-1719-6 / rank | |||
Normal rank | |||
Latest revision as of 19:39, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On convex geometric graphs with no \(k+1\) pairwise disjoint edges |
scientific article |
Statements
On convex geometric graphs with no \(k+1\) pairwise disjoint edges (English)
0 references
13 January 2017
0 references
geometric graphs
0 references
Turán-type problems
0 references
matching-free graph
0 references
