The conjectured formula for maximal chordal subgraphs
Statement
Let be the largest integer such that every graph with vertices and edges has a chordal subgraph with at least edges. For , let denote the number of edges in the balanced complete -partite graph on vertices. Let and suppose that
The maximal chordal subgraph conjecture. Then
where the minimum is taken over all satisfying
The paper determines asymptotically for all and exactly when ; this conjecture proposes the exact value throughout the remaining ranges of .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.