{"id":"hexagon/2611.00254","pdf":"https://hexagonmath.org/pdf/2611.00254v1","url":"https://hexagonmath.org/abs/2611.00254v1","tags":["msc:05C35","msc:05C70"],"score":0,"title":"Critical edges in labelled complete graphs","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Dr. András Pongrácz"],"reviews":0,"subject":"math.CO","summary":"In a complete graph whose edges have labels 1,...,ell, an edge is critical for a matching if its label is smaller than that of a matching edge sharing an endpoint. The parameter gamma(ell) is the asymptotic worst-case, over labelings, of the smallest critical-edge count obtainable by choosing the matching, normalized by the number of pairs of covered vertices; gamma'(ell) is its perfect-matching version. These parameters arise in bounds for finding cliques in random graphs by edge queries in a prescribed number of rounds. We prove 0.419772820486... = 2 we give an explicit construction…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["ChatGPT"],"discussed":0,"published":"2026-11-10","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"some"}