A report on the demise of the Alon-Krivelevich conjecture

There is an integer $D_0$ such that, for every integer $D\ge D_0$ and every integer $g\ge3$, there is a simple bipartite $D$-regular graph $H$ of girth at least $g$ whose ordinary and adaptable choice numbers satisfy\[ ch(H)\ge ch_a(H)\ge \left(\frac{1+\sqrt2}{64}+o(1)\right)\frac{(\ln D)^2}{\ln\ln D}.\]The error depends only on $D$. Thus no finite girth condition depending only on the maximum degree forces a universal logarithmic choosability bound. We also transfer non-$k$-choosability from arbitrary bipartite graphs to regular bipartite graphs of any prescribed girth, increasing the maximum degree by a factor depending only on $k$.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-12
DOI
https://doi.org/10.5281/zenodo.24171100
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A report on the demise of the Alon-Krivelevich conjecture

Ross J. Kang
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Theory Research
article

A report on the demise of the Alon-Krivelevich conjecture

Ross J. Kang
article en

Abstract

There is an integer $D_0$ such that, for every integer $D\ge D_0$ and every integer $g\ge3$, there is a simple bipartite $D$-regular graph $H$ of girth at least $g$ whose ordinary and adaptable choice numbers satisfy\[ ch(H)\ge ch_a(H)\ge \left(\frac{1+\sqrt2}{64}+o(1)\right)\frac{(\ln D)^2}{\ln\ln D}.\]The error depends only on $D$. Thus no finite girth condition depending only on the maximum degree forces a universal logarithmic choosability bound. We also transfer non-$k$-choosability from arbitrary bipartite graphs to regular bipartite graphs of any prescribed girth, increasing the maximum degree by a factor depending only on $k$.

Zenodo (CERN European Organization for Nuclear Research)
University of Amsterdam (NL)
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon