Bisection of trees and sequences

DOI10.1016/0012-365X(93)90350-3MaRDI QIDQ685643zbMATH OpenOpenAlexFDO

Authors Noga Alon, Yair Caro, Ilia Krasikov

Publication date 24 October 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90350-3

zbMATH Keywords

bisectable graphtree bisections

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1011081
• scientific article; zbMATH DE number 6303002
• Isomorphic factorizations VIII: Bisectable trees
• Partitioning infinite trees
• On judicious bisections of graphs

Cites work

• Intersection Theorems for Systems of Sets
• Isomorphic factorizations VIII: Bisectable trees
• The number of trees

Cited in

(6)

• Isomorphic factorizations VIII: Bisectable trees
• Variations on twins in permutations
• Trees and B-series
• scientific article; zbMATH DE number 1011081 (Why is no real title available?)
• Partitioning infinite trees
• Long twins in random words

This page was built for publication: Bisection of trees and sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685643)