| Article ID: | iaor19921450 |
| Country: | Netherlands |
| Volume: | 34 |
| Start Page Number: | 83 |
| End Page Number: | 105 |
| Publication Date: | Nov 1991 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Clark L.H., Entringer R.C., Szkely L.A. |
The neighborhood of a vertex in a graph is the subgraph induced by the vertices adjacent to that vertex. A graph is locally triangular provided the neighborhood of each vertex in the graph contains a triangle. The authors answer a question posed by Palmer by determining a sharp threshold function for a graph to be locally triangular.