Brambles and independent packings in chordal graphs

An independent packing of triangles is a set of pairwise disjoint triangles, no two of which are joined by an edge. A triangle bramble is a set of triangles, every pair of which intersect or are joined by an edge. More generally, I consider independent packings and brambles of any specified connected graphs, not just triangles. I give a min-max theorem for the maximum number of graphs in an independent packing of any family of connected graphs in a chordal graph, and a dual min-max theorem for the maximum number of graphs in a bramble in a chordal graph.

[1]  Kathie Cameron,et al.  Finding a maximum induced matching in weakly chordal graphs , 2003, Discret. Math..

[2]  Alexander Grigoriev,et al.  Treewidth Lower Bounds with Brambles , 2005, Algorithmica.

[3]  Peter Buneman,et al.  A characterisation of rigid circuit graphs , 1974, Discret. Math..

[4]  Vijay V. Vazirani,et al.  NP-Completeness of Some Generalizations of the Maximum Matching Problem , 1982, Inf. Process. Lett..

[5]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[6]  Martin Charles Golumbic,et al.  Irredundancy in Circular Arc Graphs , 1993, Discret. Appl. Math..

[7]  Kathie Cameron,et al.  Induced Matchings in Intersection Graphs , 2000, Electron. Notes Discret. Math..

[8]  Sulamita Klein,et al.  Partitioning chordal graphs into independent sets and cliques , 2004, Discret. Appl. Math..

[9]  F. Bruce Shepherd,et al.  Bipartite Domination and Simultaneous Matroid Covers , 2003, SIAM J. Discret. Math..

[10]  Jou-Ming Chang,et al.  Induced matchings in asteroidal triple-free graphs , 2003, Discret. Appl. Math..

[11]  Kathie Cameron,et al.  The graphs with maximum induced matching and maximum matching the same size , 2005, Discret. Math..

[12]  Moshe Lewenstein,et al.  New results on induced matchings , 2000, Discret. Appl. Math..

[13]  William T. Trotter,et al.  Induced matchings in cubic graphs , 1993, J. Graph Theory.

[14]  Sulamita Klein,et al.  On generalized split graphs , 2001, Electron. Notes Discret. Math..

[15]  Kathie Cameron,et al.  Independent packings in structured graphs , 2006, Math. Program..

[16]  William Duckworth,et al.  Maximum induced matchings of random cubic graphs , 2002 .

[17]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

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

[19]  B. Reed.  Surveys in Combinatorics, 1997: Tree Width and Tangles: A New Connectivity Measure and Some Applications , 1997 .

[20]  Vadim V. Lozin.  On maximum induced matchings in bipartite graphs , 2002, Inf. Process. Lett..

[21]  Zsolt Tuza,et al.  Induced matchings in bipartite graphs , 1989, Discret. Math..

[22]  Reinhard Diestel,et al.  Two Short Proofs Concerning Tree-Decompositions , 2002, Combinatorics, Probability and Computing.

[23]  Sulamita Klein,et al.  Packing r-Cliques in Weighted Chordal Graphs , 2005, Ann. Oper. Res..

[24]  James R. Walter,et al.  Representations of chordal graphs as subtrees of a tree , 1978, J. Graph Theory.

[25]  Udi Rotics,et al.  Finding Maximum Induced Matchings in Subclasses of Claw-Free and P5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size , 2003, Algorithmica.