The size of chordal, interval and threshold subgraphs

P. Erdös, A. Gyárfás, E. T. Ordman, Y. Zalcstein

Research output: Contribution to journalArticle

2 Citations (Scopus)


Given a graph G with n vertices and m edges, how many edges must be in the largest chordal subgraph of G? For m=n2/4+1, the answer is 3 n/2-1. For m=n2/3, it is 2 n-3. For m=n2/3+1, it is at least 7 n/3-6 and at most 8 n/3-4. Similar questions are studied, with less complete results, for threshold graphs, interval graphs, and the stars on edges, triangles, and K4's.

Original languageEnglish
Pages (from-to)245-253
Number of pages9
Issue number3
Publication statusPublished - Sep 1989


  • AMS subject classification (1980): 05C35

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Computational Mathematics

Fingerprint Dive into the research topics of 'The size of chordal, interval and threshold subgraphs'. Together they form a unique fingerprint.

  • Cite this