Indexed metadata

A Combinatorial Proof of Hilton's Conjecture and Beyond

Thomas Lesgourgues, Luke Postle

Source record

Source: arXiv

Published: Sep 24, 2026

arXiv: 2609.28966

Open original source ↗

Source abstract

Using refined absorption, we prove that for every integer g≥1g\ge 1 and real γ>0γ> 0, and for sufficiently large nn, there exists an n−1+γn^{-1+γ}-spread distribution on Latin squares of order nn and girth at least gg that have no proper subsquares. This implies a combinatorial proof of Hilton's conjecture from the 1970s (recently proved algebraically by Allsop and Wanless) that for all sufficiently large nn, there exists a subsquare-free Latin square of order nn; indeed, it implies there exist at least n(1−o(1))n2n^{(1-o(1))n^2} subsquare-free squares. Simultaneously it also implies the existence of high girth Latin squares (recently proved by Kwan, Sah, Sawhney and Simkin) and even an n−1+γn^{-1+γ}-spread distribution on high girth Latin squares.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

A Combinatorial Proof of Hilton's Conjecture and Beyond — Mathematical Frontier Network