ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(n,m)f(n,m) be the largest integer such that every graph with nn vertices and mm edges has a chordal subgraph with at least f(n,m)f(n,m) edges. For k≥2k\geq 2, let tk(n)t_k(n) denote the number of edges in the balanced complete kk-partite graph on nn vertices. Let n≥1n\geq 1 and suppose that

tk(n)+1≤m≤tk+1(n).t_k(n)+1\leq m\leq t_{k+1}(n).

The maximal chordal subgraph conjecture. Then

f(n,m)=min⁡t,r(kn−t+r)−(k+12),f(n,m)=\min_{t,r}\bigl(kn-t+r\bigr)-\binom{k+1}{2},

where the minimum is taken over all t,r≥0t,r\geq 0 satisfying

tk−1(n−t)+t(n−t)+t2(r)≥m.t_{k-1}(n-t)+t(n-t)+t_2(r)\geq m.

The paper determines f(n,m)f(n,m) asymptotically for all mm and exactly when m≤t3(n)+1m\leq t_3(n)+1; this conjecture proposes the exact value throughout the remaining ranges of mm.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.