ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, let D(G)D(G) be the multiset of all vertex-deleted induced subgraphs of GG. Average-case deck conjecture. There exists an absolute constant c>0c>0 such that, for every graph GG, at least 12∣D(G)∣\frac12|D(G)| members H∈D(G)H\in D(G) satisfy

r(H)≥c⋅r(G).r(H)\geq c\cdot r(G).

This is an average-case counterpart to the disproved assertion that every vertex-deleted graph preserves a constant fraction of the original Ramsey number; the source also discusses a stronger, unasserted possibility involving all but o(∣D(G)∣)o(|D(G)|) members.

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.