Asymptotic bound for the triangle-saturated minimum-degree constant

For fixed tt, define c(t,3)c(t,3) by

satt(n,3)=tnc(t,3)\operatorname{sat}_{t}(n,3)=tn-c(t,3)

for all sufficiently large nn. The preceding construction gives a lower bound of order 2tt3/22^{t}t^{3/2} for c(t,3)c(t,3). The asymptotic bound conjecture.

c(t,3)=O(2tt3/2).c(t,3)=O(2^{t}t^{3/2}).

This conjecture predicts that the construction is asymptotically optimal up to a constant factor. The source gives no resolution.

Sources & referencesView supporting material

Primary source

A. Nicholas Day, “Saturated Graphs of Prescribed Minimum Degree”, arXiv:1407.6664 (2016).

Progress summary

Never refreshed

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.