ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a connected triangle-free graph. A graph HH is 22-Ramsey-simple when s2(H)=2(δ(H)−1)+1s_2(H)=2(\delta(H)-1)+1, where s2(H)s_2(H) is the minimum degree that can occur in a minimal 22-Ramsey graph for HH. Grinshpun's conjecture. Every connected triangle-free graph is 22-Ramsey-simple. This strengthens the known result that all 33-connected bipartite graphs are 22-Ramsey-simple and would imply the conjecture of Szabó et al. that every bipartite graph with no isolated vertices is 22-Ramsey-simple; its status is not resolved in the source.

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.