Ahanjideh–Ekim–Yıldız conjecture for intermediate triangle-free extremal values

From papers

For natural numbers dd and ii, let f(d,i)f_{\vartriangle}(d,i) be the maximum number of edges in a triangle-free graph with maximum degree at most dd and matching number at most ii. Let Z(d)Z(d) 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 7d<i<Z(d)7\leq d<i<Z(d),

f(d,i)=di+id+1.f_{\vartriangle}(d,i)=di+i-d+1.

This conjecture supplies the missing values of f(d,i)f_{\vartriangle}(d,i) between dd and Z(d)Z(d) and is intended to imply the paper's general formula for f(d,m)f_{\vartriangle}(d,m). These intermediate cases are left open in the paper.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

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).

Solutions 0

No solutions have been posted yet.