AI Paper Atlas

Research map / Graph learning / GNN architectures

Graph Choosability via SAT: Beyond the Nullstellensatz

Markus Kirchweger, Tomáš Peitl, David Seka, Stefan Szeider

AAAI 2026 · Graph learning › GNN architectures · approach: Substructure-aware GNN expressivity · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
add the vetting method propagator (ablation)SMS choosability encoding · Bipartite graphs, 9 vertices, width 5runtime (s): 2966.41 -> 7.02 sImproved
add the vetting method propagator (ablation)SMS choosability encoding · Tripartite graphs, 9 vertices, width 5runtime (s): 3705.66 -> 432.22 sImproved
add the Nullstellensatz propagator alone (ablation)SMS choosability encoding · Bipartite graphs, 9 vertices, width 5runtime (s): 2966.41 -> 2494.83 sNo clear effect
add Nullstellensatz propagator on top of vetting (ablation)SMS choosability encoding · Bipartite graphs, 9 vertices, width 5runtime (s): 7.02 -> 6.62 sNo clear effect
add Nullstellensatz propagator on top of vetting (ablation)SMS choosability encoding · Tripartite graphs, 9 vertices, width 6runtime (s): 11606.48 -> 9858.11 sImproved
increase width bound by one color (ablation)SMS choosability encoding · Bipartite graphs, 9 vertices (vet + ns)runtime (s): 3.63 -> 6.62 s (width 4 -> 5)Hurt
tighten width bound via Corollary 1 (8 to 7 colors) for 3-choosability (ablation)SMS choosability encoding · gap graphs k=3, 9 verticessearch spaceImproved
filter triangulations by jewel absence before Nullstellensatz check (ablation)Nelsen's method · planar triangulations n=22..26runtime: only 3%-5% need NS check; 20-30x speedupImproved
branching recursive polynomial expansion instead of direct expansion (ablation)Nullstellensatz check · planar triangulations, n=17runtime (s): 6.5 minutes -> 2 secondsImproved
reduce inscribed triangles to forbidden patterns (Lemma 9) with vettingQBF encoding · 27-vertex planar graph 4-choosabilityruntime (s): direct encoding infeasible -> 203 s vetting + 3 s CQestoImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy