From 72983fb42334ceb7bc5065f8eb2ef700a9c6e8c7 Mon Sep 17 00:00:00 2001 From: Jeff Heiges Date: Fri, 14 Mar 2025 19:38:09 -0600 Subject: test --- README.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'README.md') diff --git a/README.md b/README.md index f5cfd58..9948dab 100644 --- a/README.md +++ b/README.md @@ -1,6 +1,6 @@ ## CNF Ramsey -Creates problem statements about Ramsey's theorem in CNF in the DIMACS format. More information [here](https://jgh.xyz/posts/cnf_ramsey). +Creates problem statements about Ramsey's theorem in CNF in the DIMACS format. Blog post [here](https://jgh.xyz/posts/cnf_ramsey). ## Requirements @@ -14,6 +14,6 @@ This program is written in Rust. Example: `cargo run --release 4 17 out.cnf` -The generated file can be passed to a SAT solver, like [cryptominisat](https://github.com/msoos/cryptominisat). The SAT solver will either find that the statement is satisfiable and produce a counterexample, or that the statement isn't satisfiable. If the statement is satisfiable, `R(r,r) > n`. If the statement isn't satisfiable, `R(r,r) <= n`. +The generated file can be passed to a SAT solver, like [cryptominisat](https://github.com/msoos/cryptominisat). The SAT solver will either find that the statement is satisfiable and produce a counterexample, or that the statement isn't satisfiable. If the statement is satisfiable, `R(r,r) > n`. If the statement is not satisfiable, `R(r,r) <= n`. This program will also print a labelling of the edges of the complete graph. Any labelling of the vertices can be chosen. -- cgit v1.2.3