Allen–Dhawan–Noel problem on K_{t,t}-free graphs
This entry tracks Allen–Dhawan–Noel problem on K_{t,t}-free graphs.
It improves asymptotic bounds linking local sparsity, fractional coloring, and dense induced bipartite structure.
Latest development
They prove χ_f(G)≤d/(log d−16t log log d) and obtain a 2.85+o(1) triangle-free constant.
Editorial caveat
The strongest sharp conjectured bounds remain unresolved.
References
- Dense induced bipartite subgraphs under local sparsity — arXiv — Peiru Kuang, Jing Lin, Yan Wang
Source: arXiv
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.