Light subgraphs in graphs with average degree at most four
arXiv:1512.02496 · doi:10.1016/j.disc.2016.04.020
Abstract
A graph is said to be {\em light} in a family of graphs if at least one member of contains a copy of and there exists an integer such that each member of with a copy of also has a copy of such that for all . In this paper, we study the light graphs in the class of graphs with small average degree, including the plane graphs with some restrictions on girth.
12 pages, 18 figures