On convex geometric graphs with no \(k+1\) pairwise disjoint edges (Q503641)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On convex geometric graphs with no \(k+1\) pairwise disjoint edges |
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
