29 search results - page 1 / 6 » On the Minimal Density of Triangles in Graphs |
CPC
2008
13 years 4 months ago
2008
COMBINATORICA
2006
13 years 4 months ago
2006
COMBINATORICS
2000
13 years 4 months ago
2000
It is shown in this note that with high probability it is enough to destroy all triangles in order to get a cover graph from a random graph Gn,p with p log n/n for any constant ...
JCT
2010
12 years 11 months ago
2010
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
SIAMDM
2008
13 years 4 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...