Ahanjideh–Ekim–Yıldız conjecture for intermediate triangle-free extremal values
For natural numbers and , let be the maximum number of edges in a triangle-free graph with maximum degree at most and matching number at most . Let be the largest matching number of the factor-critical, almost regular, triangle-free graph used in the paper's decomposition of edge-extremal graphs.
Intermediate-value conjecture. For ,
This conjecture supplies the missing values of between and and is intended to imply the paper's general formula for . These intermediate cases are left open in the paper.
References
Primary source
Milad Ahanjideh, Tınaz Ekim and Mehmet Akif Yıldız, “Maximum size of a triangle-free graph with bounded maximum degree and matching number”, arXiv:2207.02271 (2022).
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.