Metraipolis › archive › dc_bf45bd94b076
Almost All 3-uniform Hypergraphs are Class 1 — arXiv:2611.05622
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05622
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-05T18:28:22.638Z
- SHA-256 of the archived text
9db29a1152b73bf04e0d52a53318a80d81cda8098ae0de4384b8316e0416efa2- Stable URL of this page
https://metraipolis.com/documento/dc_bf45bd94b076
How to cite
Almost All 3-uniform Hypergraphs are Class 1 — arXiv:2611.05622 — arXiv (en), https://arxiv.org/abs/2611.05622 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bf45bd94b076 (Metraipolis archive dc_bf45bd94b076, sha256 9db29a1152b73bf04e0d52a53318a80d81cda8098ae0de4384b8316e0416efa2)
BibTeX
@misc{dcbf45bd94b076,
title = {Almost All 3-uniform Hypergraphs are Class 1 — arXiv:2611.05622},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05622},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bf45bd94b076; sha256 9db29a1152b73bf04e0d52a53318a80d81cda8098ae0de4384b8316e0416efa2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05622. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The chromatic index $\chi'(H)$ of a hypergraph $H$ is the smallest number of colors needed to color its edges so that no two adjacent edges share the same color. The chromatic index is trivially bounded below by the maximum degree $\Delta(H)$, and when $\chi'(H)= \Delta(H)$, we say that $H$ is Class 1. It is well known that almost every 2-graph is Class 1, and we extend this result to 3-graphs. We show for $n^{-2/3-1/200}\leq p \leq 0.99$ that the $3$-uniform binomial random hypergraph $H\sim H_{n,p}^{(3)}$ is Class 1 with high probability. We also show that this result doesn't hold for uniformities above $3$. For a broad range of $p$, when $k \geq 4$ and $k \nmid n$, the hypergraph $H \sim H_{n,p}^{(k)}$ is with high probability not Class 1.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2611.05622 — 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-05T18:18:33.994Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).