ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A BEL gadget is the graph-theoretic gadget used to establish computability of s(H)s(H) for a graph HH. The parameter s(H)s(H) is the minimum degree among all Ramsey HH-minimal graphs.

BEL-gadget conjecture. Every 22-connected graph has BEL gadgets.

All 33-connected graphs are known to have BEL gadgets, as do cycles and the graph Ht,2H_{t,2} considered in the paper. Whether every 22-connected graph has a BEL gadget 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.