Given a graphG withn vertices andm edges, how many edges must be in the largest chordal subgraph ofG? Form=n2/4+1, the answer is 3n/2−1. Form=n2/3, it is 2n−3. Form=n2/3+1, it is at least 7n/3−6 and at most 8n/3−4. Similar questions are studied, with less complete results, for threshold graphs, interval graphs, and the stars on edges, triangles, andK4's.
AMS subject classification (1980)05 C 35
Unable to display preview. Download preview PDF.
- V. Chvatal andP. Hammer, Aggregation of inequalities in integer programming,Ann. Discrete Math.,1 (1977), 145–162.Google Scholar
- C. S.Edwards, A lower bound for the largest number of triangles with a single edge,manuscript, (about 1977?).Google Scholar
- C. S. Edwards, The largest vertex degree sum for a triangle in a graph,Bull. London Math. Soc.,9 (1977), 203–208.Google Scholar
- P.Erdös and R.Laskar, A note on the size of a chordal subgraph,Proc. 1985 Southeastern International Conf. on Graphs, Combinatorics, and Computing, Utilitas Mathematica Publishing Co, 81–86.Google Scholar
- P.Erdös, E.Ordman, and Y.Zalcstein, Coverings and partitions with chordal and threshold graphs,submitted for publication.Google Scholar
- M. Golumbic, Algorithmic Graph Theory and Perfect Graphs,Academic Press, New York,1980.Google Scholar