Submodular functions and perfect graphs

We give a combinatorial polynomial-time algorithm to find a maximum weight independent set in perfect graphs of bounded degree that do not contain a prism or a hole of length four as an induced subgraph. An even pair in a graph is a pair of vertices all induced paths between which are even. An even set is a set of vertices every two of which are an even pair. We show that every perfect graph that does not contain a prism or a hole of length four as an induced subgraph has a balanced separator which is the union of a bounded number of even sets, where the bound depends only on the maximum degree of the graph. This allows us to solve the maximum weight independent set problem using the well-known submodular function minimization algorithm.

[1]  E. Szpilrajn.  Sur l'extension de l'ordre partiel , 1930 .

[2]  P. Atzberger.  Introduction to Nonlinear Optimization , 2020, Linear Algebra and Optimization with Applications to Machine Learning.

[3]  Alexander Schrijver,et al.  A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time , 2000, J. Comb. Theory B.

[4]  Sepehr Hajebi,et al.  Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree , 2021, 2108.01162.

[5]  A. M. Murray.  The strong perfect graph theorem , 2019, 100 Years of Math Milestones.

[6]  David R. Wood,et al.  Parameters Tied to Treewidth , 2013, J. Graph Theory.

[7]  Satoru Iwata,et al.  Submodular function minimization , 2007, Math. Program..

[8]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[9]  Maria Chudnovsky,et al.  Coloring perfect graphs with no balanced skew-partitions , 2013, J. Comb. Theory B.

[10]  Maria Chudnovsky,et al.  Holes with hats and Erdős-Hajnal , 2020 .

[11]  Chun-Hung Liu,et al.  Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable , 2019, J. Graph Theory.

[12]  Martin Grötschel,et al.  Mathematical Programming The State of the Art, XIth International Symposium on Mathematical Programming, Bonn, Germany, August 23-27, 1982 , 1983, ISMP.

[13]  László Lovász,et al.  Submodular functions and convexity , 1982, ISMP.

[14]  Gérard Cornuéjols,et al.  Square-free perfect graphs , 2004, J. Comb. Theory, Ser. B.

[15]  James B. Orlin,et al.  A faster strongly polynomial time algorithm for submodular function minimization , 2007, Math. Program..

[16]  Satoru Iwata,et al.  A combinatorial strongly polynomial algorithm for minimizing submodular functions , 2001, JACM.

[17]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..