ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph of order n≥6k+9n\ge 6k+9 with minimum degree δ≥2\delta\ge 2, and suppose that GG contains no induced cycles of lengths in {5,8,…,3k+2}\{5,8,\ldots,3k+2\}. The differential of a set D⊆V(G)D\subseteq V(G) is ∂(D)=∣B(D)∣−∣D∣\partial(D)=|B(D)|-|D|, where B(D)B(D) is the set of vertices outside DD having a neighbor in DD; the differential of GG is ∂(G)=max⁡D⊆V(G)∂(D)\partial(G)=\max_{D\subseteq V(G)}\partial(D). Bermudo's conjecture. Under these hypotheses,

∂(G)≥(2k+3)n6k+11.\partial(G)\ge \frac{(2k+3)n}{6k+11}.

This conjecture extends Bermudo's earlier lower bound for graphs of minimum degree two with specified forbidden tailed 55-cycle configurations. Its proposed bound concerns the differential of graphs subject to a family of forbidden induced cycle lengths; the source gives no resolution, so its status remains open.

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.