Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given a graphG withn vertices andm edges, how many edges must be in the largest chordal subgraph ofG? Form=n2/4+1, the ansr 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.
['Paul Erdös', 'András Gyárfás', 'Edward T. Ordman', 'Yechezkel Zalcstein']
I am writing a research paper on a idea The size of chordal, interval and threshold subgraphs
[{"from": "human", "value": "I am writing a research paper on a idea The size of chordal, interval and threshold subgraphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Given a graphG withn vertices andm edges, how many edges must be in the largest chordal subgraph ofG? Form=n2/4+1, the ansr is 3n/2\u22121. Form=n2/3, it is 2n\u22123. Form=n2/3+1, it is at least 7n/3\u22126 and at most 8n/3\u22124. Similar questions are studied, with less complete results, for threshold graphs, interval graphs, and the stars on edges, triangles, andK4's."}]