Authors compute new small two-color ordered and cyclic Ramsey numbers for monotone paths, cycles, stars, complete graphs and nested matchings via SAT solving, determine closed forms for several pairs of graph classes, obtain bounds, apply reinforcement learning for lower bounds, and introduce permut
Title resolution pending
2 Pith papers cite this work, alongside 13 external citations. Polarity classification is still indexing.
2
Pith papers citing it
13
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
math.CO 2years
2026 2roles
background 1polarities
background 1representative citing papers
SAT-based computation yields exact small reflective and dihedral Ramsey numbers for several ordered graph families, plus closed formulas and conjectures linking them to ordered and cyclic variants.
citing papers explorer
-
Some results on small ordered and cyclic Ramsey numbers
Authors compute new small two-color ordered and cyclic Ramsey numbers for monotone paths, cycles, stars, complete graphs and nested matchings via SAT solving, determine closed forms for several pairs of graph classes, obtain bounds, apply reinforcement learning for lower bounds, and introduce permut
-
Computation of small reflective and dihedral Ramsey numbers
SAT-based computation yields exact small reflective and dihedral Ramsey numbers for several ordered graph families, plus closed formulas and conjectures linking them to ordered and cyclic variants.