Cover Image

The Packing Chromatic Number of the Infinite Square Grid is 15

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Subercaseaux, Bernardo, Heule, Marijn J. H.
Format:	Preprint
Published:	2023
Subjects:	Discrete Mathematics Artificial Intelligence Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Demigod's Number for the Rubik's Cube
by: Merino, Arturo, et al.
Published: (2024)

Price of Locality in Permutation Mastermind: Are TikTok influencers Chaotic Enough?
by: Subercaseaux, Bernardo
Published: (2026)

From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT
by: Kirchweger, Markus, et al.
Published: (2025)

Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane
by: Subercaseaux, Bernardo, et al.
Published: (2023)

Automated Symmetric Constructions in Discrete Geometry
by: Subercaseaux, Bernardo, et al.
Published: (2025)

The r-Dynamic Chromatic Number is Bounded in the Strong 2-Coloring Number
by: Goetze, Miriam, et al.
Published: (2025)

Pentagon Minimization without Computation
by: Mackey, John, et al.
Published: (2024)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
by: Bourneuf, Romain, et al.
Published: (2025)

Cliques, Chromatic Number, and Independent Sets in the Semi-random Process
by: Gamarnik, David, et al.
Published: (2023)

Chromatic discrepancy of locally $s$-colourable graphs
by: Corsini, Timothée, et al.
Published: (2025)

On the Modular Chromatic Index of Random Hypergraphs
by: Carenini, Gaia, et al.
Published: (2025)

Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery
by: Przybocki, Benjamin, et al.
Published: (2026)

In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator
by: Davila, Randy, et al.
Published: (2025)

Upper Bounds on the Acyclic Chromatic Index of Degenerate Graphs
by: Anto, Nevil, et al.
Published: (2023)

Packing Topological Minors Half-Integrally
by: Liu, Chun-Hung
Published: (2017)

On the Extension Theorem for Packing Steiner Forests
by: Zeng, Jinghan A
Published: (2026)

PackIt! Gamified Rectangle Packing
by: Garrison, Thomas, et al.
Published: (2024)

Optimal and Efficient Partite Decompositions of Hypergraphs
by: Krapivin, Andrew, et al.
Published: (2025)

The Chromatic Number of Kneser Hypergraphs via Consensus Division
by: Haviv, Ishay
Published: (2023)

Further Results and Questions on $S$-Packing Coloring of Subcubic Graphs
by: Mortada, Maidoun, et al.
Published: (2024)

Packing chromatic critical graphs with radius at most 2
by: Gür, Aslıhan, et al.
Published: (2026)

Grid Minors and Products
by: Dujmović, Vida, et al.
Published: (2024)

Improving SAT Solvers on Orthogonal Latin Square Problems
by: Barnoff, Aaron, et al.
Published: (2026)

Fault-tolerant Locating-Dominating Sets on the Infinite King Grid
by: Jean, Devin, et al.
Published: (2022)

Identifying and Characterising Higher Order Interactions in Mobility Networks Using Hypergraphs
by: Sambaturu, Prathyush, et al.
Published: (2025)

Coloring Grids Avoiding Bicolored Paths
by: Keskinkilic, Derman, et al.
Published: (2023)

Counting Colored Tilings on Grids and Graphs
by: Ramírez, José L., et al.
Published: (2024)

Achievable Burning Densities of Growing Grids
by: Barrett, Jordan, et al.
Published: (2026)

Infinite Schnyder Woods
by: Addario-Berry, Louigi, et al.
Published: (2025)

Basis Number and Pathwidth
by: Miraftab, Babak, et al.
Published: (2026)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)

Sums of $k$-bonacci Numbers
by: Parks, Harold R., et al.
Published: (2022)

On the Cop Number of String Graphs
by: Das, Sandip, et al.
Published: (2024)

Separation Number and Treewidth, Revisited
by: Houdrouge, Hussein, et al.
Published: (2025)

The Graph Coloring Game on $4\times n$-Grids
by: Brosse, Caroline, et al.
Published: (2024)

Using Code Generation to Solve Open Instances of Combinatorial Design Problems
by: Rosin, Christopher D.
Published: (2025)

Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools
by: Du, Alina, et al.
Published: (2026)

Automated Discovery of Improved Constant Weight Binary Codes
by: Rosin, Christopher D.
Published: (2026)

An AI enhanced approach to the tree unimodality conjecture
by: Ramos, Eric, et al.
Published: (2025)

A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs
by: Zhang, Jiechen
Published: (2026)