Existence conjecture for doubly saturated Ramsey-good graphs

Less than 1 year old · traced to

Let s,t≥3s,t \ge 3 with s≤ts \le t and (s,t)∉{(3,4),(3,6)}(s,t) \notin \{(3,4),(3,6)\}. A graph is doubly saturated R(s,t)R(s,t)-good if it is R(s,t)R(s,t)-good and remains so under the relevant double-saturation condition described in the paper. Existence conjecture. For every such pair (s,t)(s,t), there is a doubly saturated R(s,t)R(s,t)-good graph. The conjecture extends the authors' construction of infinitely many circulant examples, while the exceptional parameter pairs are excluded; its general status is open.

References

Primary source

Benjamin Przybocki, John Mackey, Marijn J. H. Heule and Bernardo Subercaseaux, “Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery”, arXiv:2604.21187 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.