Abstract
For a fixed ρ ∈ [0, 1], what is (asymptotically) the minimal possible density g3(ρ) of triangles in a graph with edge density ρ? We completely solve this problem by proving thatwhere$t\df \lfloor 1/(1-\rho)\rfloor$is the integer such that$\rho\in\bigl[ 1-\frac 1t,1-\frac 1{t+1}\bigr]$.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
118 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. New Ramsey Multiplicity Bounds and Search Heuristics;Foundations of Computational Mathematics;2024-08-26
2. Cancellative hypergraphs and Steiner triple systems;Journal of Combinatorial Theory, Series B;2024-07
3. Phase Transitions of Structured Codes of Graphs;SIAM Journal on Discrete Mathematics;2024-06-19
4. Simple evolving random graphs;Physical Review E;2024-06-10
5. Tropicalizing the Graph Profile of Some Almost-Stars;SIAM Journal on Discrete Mathematics;2024-04-22