{"id":"palomar/PALOMAR-2026-11-07-000010","url":"https://github.com/igor-kortchemski/critical-trees-height-width/tree/96b7595cda3a0dedf6f97af3dbcae2ed694c0b11","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-07-000010-v1.json","repo":"https://github.com/igor-kortchemski/critical-trees-height-width","tags":["math.PR","math.CO","msc:60J80","msc:60C05","msc:05C05","msc:60F05"],"score":0,"title":"Critical trees are neither too short nor too fat","trust":"high","domain":"math.PR","source":"palomar","authors":["Igor Kortchemski"],"reviews":0,"subject":"math.PR","summary":"Lean 4 proofs of the main results of Addario-Berry, Donderwinkel and Kortchemski, \"Critical trees are neither too short nor too fat\" (arXiv:2311.06163). For every critical offspring law, the height of the size-conditioned Bienaymé tree divided by log n tends to infinity and its width divided by n tends to zero in probability, along admissible sizes. These bounds are sharp: for every function f tending to infinity, a single critical offspring law has limsup P(height n/f(n)) = 1. For critical offspring laws in the local domain of attraction of the asymmetric Cauchy law (mu_n = L(n)/n^2 with L…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-07","reactions":{},"formalized":true,"formalizes":[{"title":"Critical trees are neither too short nor too fat","identifier":"arXiv:2311.06163","relationship":"formalizes"},{"title":"Random trees have height O(sqrt(n))","identifier":"arXiv:2201.11773","relationship":"formalizes"}]}