Families of Trees Decompose the Random Graph in an Arbitrary Way

DOI10.1017/S096354830400639XzbMath1057.05070arXivmath/0210339OpenAlexW2158150582MaRDI QIDQ4650645

Raphael Yuster

Publication date: 18 February 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0210339

zbMATH Keywords

random graphthresholddecomposabletotally decomposable

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Combinatorial and computational aspects of graph packing and graph decomposition

This page was built for publication: Families of Trees Decompose the Random Graph in an Arbitrary Way