Inducibility in binary trees and crossings in random tanglegrams (Q5348495)
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 6762096
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inducibility in binary trees and crossings in random tanglegrams |
scientific article; zbMATH DE number 6762096 |
Statements
Inducibility in Binary Trees and Crossings in Random Tanglegrams (English)
0 references
18 August 2017
0 references
subtrees
0 references
caterpillar
0 references
complete binary tree
0 references
inducibility
0 references
tanglegram
0 references
crossing number
0 references
0 references
0 references
0.8176270723342896
0 references
0.8071684241294861
0 references
0.7997766137123108
0 references
0.7973131537437439
0 references
0.7947487235069275
0 references
