论文信息 - A note on kernels and Sperner's Lemma

A note on kernels and Sperner's Lemma

The kernel-solvability of perfect graphs was first proved by Boros and Gurvich, and later Aharoni and Holzman gave a shorter proof. Both proofs were based on Scarf's Lemma. In this note we show that a very simple proof can be given using a polyhedral version of Sperner's Lemma. In addition, we extend the Boros-Gurvich theorem to h-perfect graphs and to a more general setting.

Tamás Király | Júlia Pap | Tamás Király | Júlia Pap

[1] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[2] H. Scarf. The Core of an N Person Game , 1967 .

[3] G. Ziegler. Lectures on Polytopes , 1994 .

[4] F. Bruce Shepherd,et al. Applying Lehman's theorems to packing problems , 1995, Math. Program..

[5] J. P. Uhry,et al. A class of h-perfect graphs , 1984, Discret. Math..

[6] Vladimir Gurvich,et al. Perfect graphs are kernel solvable , 1996, Discret. Math..

[7] Ron Holzman,et al. Fractional Kernels in Digraphs , 1998, J. Comb. Theory, Ser. B.

[8] Vladimir Gurvich,et al. Perfect graphs, kernels, and cores of cooperative games , 2006, Discret. Math..

[9] Tamás Király,et al. Kernels, Stable Matchings, and Scarf's Lemma , 2010 .

[10] George L. Nemhauser,et al. Polyhedral Characterizations, Perfection of Line Graphs , 1998, Discret. Appl. Math..

[11] P. Seymour,et al. The Strong Perfect Graph Theorem , 2002, math/0212070.

[12] Bert Gerards,et al. Matrices with the edmonds—Johnson property , 1986, Comb..

[13] K. Brown,et al. Graduate Texts in Mathematics , 1982 .

[14] S. E. Markosyan,et al. ω-Perfect graphs , 1990 .

[15] Ali Ridha Mahjoub,et al. Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor , 1994, SIAM J. Discret. Math..

[16] D. R. Fulkerson,et al. Anti-blocking polyhedra , 1972 .

[17] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..