Degrees and Matchings.
STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
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
- Operations Research