ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let s(H)s(H) denote the minimum degree among all Ramsey HH-minimal graphs. Let HH be a connected graph on nn vertices, and let δ\delta be its minimum degree.

Linear upper-bound conjecture.

s(H)≤δ(n−1).s(H)\leq \delta(n-1).

The conjecture gives an upper bound for s(H)s(H) in terms of the order and minimum degree of HH, and the source notes that it is tight for both KkK_k and Kk⋅K2K_k\mathbin{\cdot}K_2. Its general validity 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.