Metraipolis › archive › dc_78abbcb02844

Stability and exact extremal colourings for the Alon--Frankl--Lovász bound — arXiv:2611.02885

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02885
License (as archived)
CC0-1.0
Archived
2026-11-03T11:37:37.140Z
SHA-256 of the archived text
9c22beeb7607aba0007d027a7d592016788d8ea3c1b2f7e294be64f7e12ddacf
Stable URL of this page
https://metraipolis.com/documento/dc_78abbcb02844

How to cite

Stability and exact extremal colourings for the Alon--Frankl--Lovász bound — arXiv:2611.02885 — arXiv (en), https://arxiv.org/abs/2611.02885 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_78abbcb02844 (Metraipolis archive dc_78abbcb02844, sha256 9c22beeb7607aba0007d027a7d592016788d8ea3c1b2f7e294be64f7e12ddacf)
BibTeX
@misc{dc78abbcb02844,
  title = {Stability and exact extremal colourings for the Alon--Frankl--Lovász bound — arXiv:2611.02885},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02885},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_78abbcb02844; sha256 9c22beeb7607aba0007d027a7d592016788d8ea3c1b2f7e294be64f7e12ddacf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02885. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The Alon--Frankl--Lovász theorem states that every $q$-colouring of the edges of the complete $r$-uniform hypergraph on $n$ vertices contains a monochromatic matching of size $\lfloor(n+q-1)/(r+q-1)\rfloor$. For fixed uniformity $r$ and number of colours $q$, we prove a stability theorem: every colouring whose largest monochromatic matching has size at most $n/(r+q-1)+o(n)$ differs from a threshold extremal colouring on only $o(n^r)$ edges. We also give a necessary and sufficient structural characterization of all extremal colourings for sufficiently large $n$. The proofs combine rigidity of fractional covering weights with an extension argument for prescribed matchings. These results answer, for sufficiently large orders, the stability and extremal-colouring questions posed by Gishboliner, Glock, Michaeli and Sgueglia.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.02885 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:05:22.309Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).