Image de couverture de livre

Proving Norine's Conjecture holds for $n=7$ via SAT solvers

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Frankston, Keith, Scheinerman, Danny
Format:	Preprint
Publié:	2024
Sujets:	Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT
par: Kirchweger, Markus, et autres
Publié: (2025)

Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic
par: Scheinerman, Danny
Publié: (2024)

Large-scale Monte Carlo simulations for zeros in character tables of symmetric groups
par: Miller, Alexander R., et autres
Publié: (2023)

On Independent Spanning Trees in Random and Pseudorandom Graphs
par: Draganić, Nemanja, et autres
Publié: (2025)

Proof of Brouwers Conjecture (BC) for all graphs with number of vertices n > n_0 assuming that BC holds for n< n_0 for some n_0
par: Blinovsky, Vladimir, et autres
Publié: (2019)

The Gamma-Theta Conjecture holds for planar graphs
par: Taletskii, Dmitrii
Publié: (2024)

The Total Coloring Conjecture holds for planar graphs without three special subgraphs
par: Su, Rongjin, et autres
Publié: (2025)

Dominating Hadwiger's Conjecture holds for all $2K_2$-free graphs
par: Song, Zi-Xia, et autres
Publié: (2025)

Constructing strong starters of orders $3p$: triplication with SAT solver
par: Ogandzhanyants, Oleg, et autres
Publié: (2025)

Finding hardness reductions automatically using SAT solvers
par: Bergold, Helena, et autres
Publié: (2024)

Investigating Simple Drawings of $K_n$ using SAT
par: Bergold, Helena, et autres
Publié: (2025)

Improved Exponent for Marton's Conjecture in $\mathbb{F}_2^n$
par: Liao, Jyun-Jie
Publié: (2024)

Erdös's Matching Conjecture and $s$-wise $t$-intersection Conjecture via Symmetrical Smoothing Method
par: Blinovsky, Vladimir
Publié: (2014)

A Proof of the $(n,k,t)$-Conjectures
par: Baumann, Stacie, et autres
Publié: (2022)

Inhomogeneous random 2-SAT
par: Hladký, Jan, et autres
Publié: (2025)

Seymour and Woodall's conjecture holds for graphs with independence number two
par: Chen, Rong, et autres
Publié: (2024)

Proving it is impossible; on Erdős problem $\# 278$
par: Cambie, Stijn
Publié: (2025)

Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening
par: Savchuk, Pavlo
Publié: (2025)

AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
par: Jha, Piyush, et autres
Publié: (2024)

Hadwiger's conjecture holds for strongly monotypic polytopes
par: Bui, Vuong
Publié: (2024)

Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces
par: Hu, Sihuang, et autres
Publié: (2025)

Proving exact values for the $2$-limited broadcast domination number on grid graphs
par: Slobodin, Aaron, et autres
Publié: (2021)

Towards the Overfull Conjecture
par: Shan, Songling
Publié: (2023)

Polynomization of Sun's Conjecture
par: Neuhauser, Bernhard Heim und Markus
Publié: (2026)

The Sunflower Conjecture Proven
par: Fukuyama, Junichiro
Publié: (2022)

Posets for which Verdier duality holds
par: Aoki, Ko
Publié: (2022)

A Modular Inductive Proof of the Chen-Raspaud Conjecture via Graph Classification
par: Fiedorowicz, Michał
Publié: (2024)

On the $k$-anti-traceability Conjecture
par: Chen, Bin, et autres
Publié: (2024)

Full Resolution to Papikian's Conjecture
par: Vollrath, Paul
Publié: (2025)

Augmentation Lemma for Halin Conjecture
par: Wojciechowski, Jerzy
Publié: (2026)

Note on the Additive Basis Conjecture
par: Yu, Yang
Publié: (2025)

Proofs Of Three Geode Conjectures
par: Amdeberhan, Tewodros, et autres
Publié: (2025)

WalkSAT is linear on random 2-SAT
par: Berenbrink, Petra, et autres
Publié: (2024)

On the Spielman-Teng Conjecture
par: Sah, Ashwin, et autres
Publié: (2024)

The lonely runner conjecture holds for eight runners
par: Rosenfeld, Matthieu
Publié: (2025)

The lonely runner conjecture holds for nine runners
par: Rosenfeld, Matthieu
Publié: (2025)

Approximately counting maximal independent set is equivalent to #SAT
par: Zhang, Hao, et autres
Publié: (2024)

Improving SAT Solvers on Orthogonal Latin Square Problems
par: Barnoff, Aaron, et autres
Publié: (2026)

Combinatorial Geometry of Erdős--Szekeres Type Problems: SAT/ASP Modeling and Linear Subreduction
par: Koshelev, Vitalii, et autres
Publié: (2026)

A note on the Erdős Matching Conjecture
par: Martin, Ryan R., et autres
Publié: (2024)