Markus Kirchweger

collaborators

3 papers

math.CO2025

From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT

Markus Kirchweger, TomÃ¡Å¡ Peitl, Bernardo Subercaseaux +1

Norin (2008) conjectured that any $2$ -edge-coloring of the hypercube $Q_{n}$ in which antipodal edges receive different colors must contain a monochromatic path between some pair of…

cs.LO2025

Breaking Symmetries in Quantified Graph Search: A Comparative Study

MikolÃ¡Å¡ Janota, Markus Kirchweger, TomÃ¡Å¡ Peitl +1

Graph generation and enumeration problems often require handling equivalent graphs -- those that differ only in vertex labeling. We study how to extend SAT Modulo Symmetries (SMS),…

cs.AI2025

Smart Cubing for Graph Search: A Comparative Study

Markus Kirchweger, Hai Xia, TomÃ¡Å¡ Peitl +1

Parallel solving via cube-and-conquer is a key method for scaling SAT solvers to hard instances. While cube-and-conquer has proven successful for pure SAT problems, notably the Pyt…