Asymptotic bound for the triangle-saturated minimum-degree constant
Asymptotic bound for the triangle-saturated minimum-degree constant
For fixed , define by
for all sufficiently large . The preceding construction gives a lower bound of order for . The asymptotic bound conjecture.
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
Sign in to submit a solution.
No solutions have been posted yet.