Abstract
A result of Friedman and Pippenger gives a sufficient condition on the expansion properties of a graph to contain all small trees with bounded maximum degree. In this paper, we extend the tree embedding problem of expanding graphs to the degenerate graph embedding problem, and give a sufficient condition for a graph to contain strong [Formula: see text]-degenerate subgraphs with bounded maximum codegree.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call