论文信息 - Independence and the Havel-Hakimi residue

Independence and the Havel-Hakimi residue

Favaron et al. (1991) have obtained a proof of a conjecture of Fajtlowicz' computer program Graffiti that for every graph G the number of zeroes left after fully reducing the degree sequence as in the Havel-Hakimi Theorem is at most the independence number of G. In this paper we present a simplified version of the proof of Graffiti's conjecture, and we find how the residue relates to a natural greedy algorithm for constructing large independent sets in G.

Daniel J. Kleitman | Jerrold R. Griggs | D. Kleitman | J. Griggs

[1] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.

[2] S. Hakimi. On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .

[3] Jerrold R. Griggs. Lower bounds on the independence number in terms of the degrees , 1983, J. Comb. Theory, Ser. B.

[4] Siemion Fajtlowicz,et al. On conjectures of Graffiti , 1988, Discret. Math..

[5] Odile Favaron,et al. On the residue of a graph , 1991, J. Graph Theory.