Browse posts by tag
Four extremal graphs deposited to the House of Graphs: a minimum C6-saturated graph and three Zarankiewicz witnesses. Plus two new exact saturation values, verified and prepared for deposit.
Fifteen integer sequences now published in the OEIS: nine authored, six extended. Computed by SAT solving and exhaustive search, checked against prior art, spread across seven fields.
Extremal-graph witnesses I deposited to the House of Graphs: minimum saturated graphs for C6, K_4, and P_4, and extremal Zarankiewicz bipartite graphs z(m,n;3,4). Each computed by SAT solving or exhaustive enumeration, re-verified from its graph6 …
Integer sequences I have authored or extended in the On-Line Encyclopedia of Integer Sequences, across Ramsey theory, extremal graph theory, knot theory, algebraic graph theory, additive combinatorics, Boolean function complexity, and combinatorial …
Which codeword-length vectors are achievable by prefix-free codes? Kraft's inequality is the answer.