We find asymptotics of the maximum size of a chordal subgraph in a binomial random graph $G(n,p)$ , for p=const and p=n-α +o(1) .
No takes yet. Share an insight, caveat, or question.
Krivelevich et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: