Back to Search
Start Over
On the Minimal Density of Triangles in Graphs
- Source :
- Combinatorics, Probability and Computing. 17:603-618
- Publication Year :
- 2008
- Publisher :
- Cambridge University Press (CUP), 2008.
-
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]$.
Details
- ISSN :
- 14692163 and 09635483
- Volume :
- 17
- Database :
- OpenAIRE
- Journal :
- Combinatorics, Probability and Computing
- Accession number :
- edsair.doi...........b91e1e5014f84d6703c2865589f28bc6
- Full Text :
- https://doi.org/10.1017/s0963548308009085