The BEL-gadget conjecture for 2-connected graphs
Statement
A BEL gadget is the graph-theoretic gadget used to establish computability of for a graph . The parameter is the minimum degree among all Ramsey -minimal graphs.
BEL-gadget conjecture. Every -connected graph has BEL gadgets.
All -connected graphs are known to have BEL gadgets, as do cycles and the graph considered in the paper. Whether every -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.