Equality of the asymptotic clique bounds for bounded maximum average degree
For each positive integer , let be the minimum value such that there is a constant with
whenever is -degenerate and has maximum degree at most . Let be the minimum value such that there is a constant with
whenever has maximum average degree less than and maximum degree at most . The equality conjecture states that, for all ,
The paper proves the equality for , while its validity for larger values of remains open; the authors do not conjecture the precise values of either parameter.
References
Primary source
Daniel W. Cranston and Gexin Yu, “Cliques in Squares of Graphs with Maximum Average Degree less than 4”, arXiv:2305.11763 (2024).
Progress summary
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.