Grinshpun's conjecture on Ramsey-simple triangle-free graphs
Statement
Let be a connected triangle-free graph. A graph is -Ramsey-simple when , where is the minimum degree that can occur in a minimal -Ramsey graph for . Grinshpun's conjecture. Every connected triangle-free graph is -Ramsey-simple. This strengthens the known result that all -connected bipartite graphs are -Ramsey-simple and would imply the conjecture of Szabó et al. that every bipartite graph with no isolated vertices is -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.