Degrees and matchings

Abstract Let n , b , d be positive integers. We evaluate f ( n , b , d ), the largest possible number of edges in a graph with n vertices having no vertex of degree greater than d and no set of more than b independent edges. Our proof technique has a linear programming flavor and uses Berge's matching formula.

[1]  J. Moon.  On Independent Complete Subgraphs in a Graph , 1968, Canadian Journal of Mathematics.

[2]  H. L. Abbott,et al.  Intersection Theorems for Systems of Sets , 1972, J. Comb. Theory, Ser. A.

[3]  H. L. Abbott.  Some Remarks on a Combinatorial Theorem of Erdös and Rado , 1966, Canadian Mathematical Bulletin.

[4]  P. Erdös,et al.  Intersection Theorems for Systems of Sets , 1960 .

[5]  V. Chvátal.  On finite δ-systems of Erdős and Rado , 1970 .