Name
Abstract | ||
|---|---|---|
It is known that for a graph on n vertices [n(2)/4] + 1 edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence of k triangles intersecting in exactly one common vertex. (C) 1995 Academic Press, Inc. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1006/jctb.1995.1026 | J. Comb. Theory, Ser. B |
Field | DocType | Volume |
Graph,Combinatorics,Vertex (geometry),CPCTC,Cycle graph,Nested triangles graph,Multiple edges,Mathematics | Journal | 64 |
Issue | ISSN | Citations |
1 | 0095-8956 | 13 |
PageRank | References | Authors |
1.48 | 2 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| P Erdös | 1 | 626 | 190.85 |
| Zoltán Füredi | 2 | 1237 | 233.60 |
| Ronald J. Gould | 3 | 641 | 94.81 |
| D. S. Gunderson | 4 | 22 | 2.64 |