Explores isolators for tournaments, suggesting potential in Ramsey number computations.
Isolators are a useful tool for reducing the computation needed to solve graph existence problems via SAT.We extend techniques for creating isolators for undirected graphs to the tournament (complete, directed) case, noting several parallels in properties of isolators for the two classes.We further present an algorithm for constructing n-vertex tournament isolators with Θ(n log n) unit clauses.Finally, we show the utility of our new isolators in computations of tournament Ramsey numbers.
No takes yet. Share an insight, caveat, or question.
Lohn et al. (2022) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: