Bisection of trees and sequences (Q685643)
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: Bisection of trees and sequences |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bisection of trees and sequences |
scientific article |
Statements
Bisection of trees and sequences (English)
0 references
24 October 1993
0 references
A bisectable graph \(G\) is the edge-disjoint union of two isomorphic subgraphs. The authors show a quantified version of the fact that any tree with \(e\) edges contains a bisectable subgraph with (asymptotically) almost all edges.
0 references
tree bisections
0 references
bisectable graph
0 references
