Independence and matching number in graphs with maximum degree 4.

Abstract: We prove that and for every triangle-free graph with maximum degree at most , where is the independence number and is the matching number of , respectively. These results are sharp for a graph on vertices. Furthermore we show for -free graphs, where is the chromatic number and is the clique number of , respectively. [Copyright &y& Elsevier]