A characterization of claw-free CIS graphs and new results on the order of CIS graphs

A graph is CIS if every maximal clique interesects every maximal stable set. Currently, no good characterization or recognition algorithm for the CIS graphs is known. We characterize graphs in which every maximal matching saturates all vertices of degree at least two and use this result to give a structural, efficiently testable characterization of claw-free CIS graphs. We answer in the negative a question of Dobson, Hujdurovic, Milanic, and Verret [Vertex-transitive CIS graphs, European J. Combin. 44 (2015) 87-98] asking whether the number of vertices of every CIS graph is bounded from above by the product of its clique and stability numbers. On the positive side, we show that the question of Dobson et al. has an affirmative answer in the case of claw-free graphs.

[1]  Miklós Bartha,et al.  Deciding the deterministic property for soliton graphs , 2009, Ars Math. Contemp..

[2]  Vladimir Gurvich,et al.  On equistable, split, CIS, and related classes of graphs , 2015, Discret. Appl. Math..

[3]  Nick Roussopoulos,et al.  A MAX{m, n} Algorithm for Determining the Graph H from Its Line Graph C , 1973, Inf. Process. Lett..

[4]  Bernard Ries,et al.  Detecting strong cliques , 2018, Discret. Math..

[5]  Vladimir Gurvich,et al.  On Graphs Whose Maximal Cliques and Stable Sets Intersect , 2018 .

[6]  Martin Milanic,et al.  On graphs vertex-partitionable into strong cliques , 2016, Discret. Math..

[7]  Martin Milanic,et al.  Equistarable Graphs and Counterexamples to Three Conjectures on Equistable Graphs , 2017, J. Graph Theory.

[8]  Edward Dobson,et al.  Vertex-transitive CIS graphs , 2014, Eur. J. Comb..

[9]  Paul Erdös,et al.  Ramsey-type theorems , 1989, Discret. Appl. Math..

[10]  Wenan Zang,et al.  Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs , 1995, Discret. Math..

[11]  Igor E. Zverovich,et al.  Bipartite bihypergraphs: A survey and new results , 2006, Discret. Math..

[12]  Philippe G. H. Lehot.  An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph , 1974, JACM.

[13]  Vladimir Gurvich,et al.  On CIS circulants , 2013, Discret. Math..

[14]  Gregory A Petsko,et al.  Dominoes , 2011, Genome Biology.

[15]  Xiaotie Deng,et al.  Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs , 2004, J. Comb. Theory, Ser. B.

[16]  Vladimir Gurvich,et al.  Decomposing complete edge-chromatic graphs and hypergraphs. Revisited , 2009, Discret. Appl. Math..

[17]  Maria Chudnovsky,et al.  The Erdös–Hajnal Conjecture—A Survey , 2014, J. Graph Theory.

[18]  Miklós Bartha,et al.  Tutte type theorems for graphs having a perfect internal matching , 2004, Inf. Process. Lett..

[19]  Miklós Bartha,et al.  A Structure Theorem for Maximum Internal Matchings in Graphs , 1991, Inf. Process. Lett..

[20]  L. Lovász.  A Characterization of Perfect Graphs , 1972 .

[21]  Endre Boros,et al.  Equistarable bipartite graphs , 2015, Discret. Math..

[22]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[23]  Regina Tyshkevich,et al.  Line Graphs of Helly Hypergraphs , 2003, SIAM J. Discret. Math..

[24]  Martin Milanič,et al.  A polynomial algorithm to find an independent set of maximum weight in a fork-free graph , 2006, SODA '06.

[25]  Vladimir Gurvich,et al.  Not complementary connected and not CIS d-graphs form weakly monotone families , 2010, Discret. Math..

[26]  H. Whitney.  Congruent Graphs and the Connectivity of Graphs , 1932 .

[28]  David P. Summer.  Randomly matchable graphs , 1979, J. Graph Theory.

[29]  Jeong Han Kim,et al.  The Ramsey Number R(3, t) Has Order of Magnitude t2/log t , 1995, Random Struct. Algorithms.

[30]  D. West.  Introduction to Graph Theory , 1995 .

[31]  Ademir Hujdurovic,et al.  Strong cliques in vertex‐transitive graphs , 2018, J. Graph Theory.

[32]  V. Gurvich.  Decomposing complete edge-chromatic graphs and hypergraphs , 2007 .