Saved in:
| Main Authors: | Frankston, Keith, Scheinerman, Danny |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.02474 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT
by: Kirchweger, Markus, et al.
Published: (2025)
by: Kirchweger, Markus, et al.
Published: (2025)
Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic
by: Scheinerman, Danny
Published: (2024)
by: Scheinerman, Danny
Published: (2024)
Large-scale Monte Carlo simulations for zeros in character tables of symmetric groups
by: Miller, Alexander R., et al.
Published: (2023)
by: Miller, Alexander R., et al.
Published: (2023)
On Independent Spanning Trees in Random and Pseudorandom Graphs
by: Draganić, Nemanja, et al.
Published: (2025)
by: Draganić, Nemanja, et al.
Published: (2025)
The Gamma-Theta Conjecture holds for planar graphs
by: Taletskii, Dmitrii
Published: (2024)
by: Taletskii, Dmitrii
Published: (2024)
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
by: Blinovsky, Vladimir, et al.
Published: (2019)
by: Blinovsky, Vladimir, et al.
Published: (2019)
The Total Coloring Conjecture holds for planar graphs without three special subgraphs
by: Su, Rongjin, et al.
Published: (2025)
by: Su, Rongjin, et al.
Published: (2025)
Dominating Hadwiger's Conjecture holds for all $2K_2$-free graphs
by: Song, Zi-Xia, et al.
Published: (2025)
by: Song, Zi-Xia, et al.
Published: (2025)
Finding hardness reductions automatically using SAT solvers
by: Bergold, Helena, et al.
Published: (2024)
by: Bergold, Helena, et al.
Published: (2024)
Constructing strong starters of orders $3p$: triplication with SAT solver
by: Ogandzhanyants, Oleg, et al.
Published: (2025)
by: Ogandzhanyants, Oleg, et al.
Published: (2025)
Investigating Simple Drawings of $K_n$ using SAT
by: Bergold, Helena, et al.
Published: (2025)
by: Bergold, Helena, et al.
Published: (2025)
A Proof of the $(n,k,t)$-Conjectures
by: Baumann, Stacie, et al.
Published: (2022)
by: Baumann, Stacie, et al.
Published: (2022)
Improved Exponent for Marton's Conjecture in $\mathbb{F}_2^n$
by: Liao, Jyun-Jie
Published: (2024)
by: Liao, Jyun-Jie
Published: (2024)
Erdös's Matching Conjecture and $s$-wise $t$-intersection Conjecture via Symmetrical Smoothing Method
by: Blinovsky, Vladimir
Published: (2014)
by: Blinovsky, Vladimir
Published: (2014)
Inhomogeneous random 2-SAT
by: Hladký, Jan, et al.
Published: (2025)
by: Hladký, Jan, et al.
Published: (2025)
Proving it is impossible; on Erdős problem $\# 278$
by: Cambie, Stijn
Published: (2025)
by: Cambie, Stijn
Published: (2025)
Seymour and Woodall's conjecture holds for graphs with independence number two
by: Chen, Rong, et al.
Published: (2024)
by: Chen, Rong, et al.
Published: (2024)
Hadwiger's conjecture holds for strongly monotypic polytopes
by: Bui, Vuong
Published: (2024)
by: Bui, Vuong
Published: (2024)
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
by: Jha, Piyush, et al.
Published: (2024)
by: Jha, Piyush, et al.
Published: (2024)
Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening
by: Savchuk, Pavlo
Published: (2025)
by: Savchuk, Pavlo
Published: (2025)
Posets for which Verdier duality holds
by: Aoki, Ko
Published: (2022)
by: Aoki, Ko
Published: (2022)
WalkSAT is linear on random 2-SAT
by: Berenbrink, Petra, et al.
Published: (2024)
by: Berenbrink, Petra, et al.
Published: (2024)
Accelerating Monte-Carlo Tree Search with Optimized Posterior Policies
by: Frankston, Keith, et al.
Published: (2026)
by: Frankston, Keith, et al.
Published: (2026)
The lonely runner conjecture holds for eight runners
by: Rosenfeld, Matthieu
Published: (2025)
by: Rosenfeld, Matthieu
Published: (2025)
The lonely runner conjecture holds for nine runners
by: Rosenfeld, Matthieu
Published: (2025)
by: Rosenfeld, Matthieu
Published: (2025)
Proving exact values for the $2$-limited broadcast domination number on grid graphs
by: Slobodin, Aaron, et al.
Published: (2021)
by: Slobodin, Aaron, et al.
Published: (2021)
Hegedus' Conjecture and Tighter Upper Bounds for Equidistant Codes in Hamming Spaces
by: Hu, Sihuang, et al.
Published: (2025)
by: Hu, Sihuang, et al.
Published: (2025)
Towards the Overfull Conjecture
by: Shan, Songling
Published: (2023)
by: Shan, Songling
Published: (2023)
Polynomization of Sun's Conjecture
by: Neuhauser, Bernhard Heim und Markus
Published: (2026)
by: Neuhauser, Bernhard Heim und Markus
Published: (2026)
The Sunflower Conjecture Proven
by: Fukuyama, Junichiro
Published: (2022)
by: Fukuyama, Junichiro
Published: (2022)
Proving the existence of Euclidean knight's tours on $n \times n \times \cdots \times n$ chessboards for $n < 4$
by: Ripà, Marco
Published: (2023)
by: Ripà, Marco
Published: (2023)
Queen Domination by SAT Solving
by: Rostami, Taha, et al.
Published: (2025)
by: Rostami, Taha, et al.
Published: (2025)
Approximately counting maximal independent set is equivalent to #SAT
by: Zhang, Hao, et al.
Published: (2024)
by: Zhang, Hao, et al.
Published: (2024)
Improving SAT Solvers on Orthogonal Latin Square Problems
by: Barnoff, Aaron, et al.
Published: (2026)
by: Barnoff, Aaron, et al.
Published: (2026)
The burning number conjecture holds for trees of order $n$ with at most $\left\lfloor \sqrt{n-1}\right\rfloor$ degree-2 vertices
by: Ning, Jiajun, et al.
Published: (2025)
by: Ning, Jiajun, et al.
Published: (2025)
On the $k$-anti-traceability Conjecture
by: Chen, Bin, et al.
Published: (2024)
by: Chen, Bin, et al.
Published: (2024)
Full Resolution to Papikian's Conjecture
by: Vollrath, Paul
Published: (2025)
by: Vollrath, Paul
Published: (2025)
Augmentation Lemma for Halin Conjecture
by: Wojciechowski, Jerzy
Published: (2026)
by: Wojciechowski, Jerzy
Published: (2026)
Note on the Additive Basis Conjecture
by: Yu, Yang
Published: (2025)
by: Yu, Yang
Published: (2025)
Proofs Of Three Geode Conjectures
by: Amdeberhan, Tewodros, et al.
Published: (2025)
by: Amdeberhan, Tewodros, et al.
Published: (2025)
Similar Items
-
From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT
by: Kirchweger, Markus, et al.
Published: (2025) -
Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic
by: Scheinerman, Danny
Published: (2024) -
Large-scale Monte Carlo simulations for zeros in character tables of symmetric groups
by: Miller, Alexander R., et al.
Published: (2023) -
On Independent Spanning Trees in Random and Pseudorandom Graphs
by: Draganić, Nemanja, et al.
Published: (2025) -
The Gamma-Theta Conjecture holds for planar graphs
by: Taletskii, Dmitrii
Published: (2024)