Accession Number:

AD0742348

Title:

Degrees and Matchings.

Descriptive Note:

Technical rept.,

Corporate Author:

STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Personal Author(s):

Report Date:

1972-03-01

Pagination or Media Count:

19.0

Abstract:

Let n, b, d be positive integers. D. Hanson proposed to evaluate fn,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. Using the alternating path method, he found partial results in this direction. he author completes Hansons work the proof technique has a linear programming flavor and uses Berges matching formula. Author

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE