load ../SageFiles/cliqueminor1rd.spyx
numtri = 5
graphlist = load('nominor114040.sobj')

def numtriangles(G, e):
	tri = 0;
	for i in G.neighbors(e[0]):
		if i in G.neighbors(e[1]):
			tri = tri + 1;
	return tri;

for position, G in enumerate(graphlist):
	numverttri = 0;
	for v in G.vertices():
		numtriedge = 0;
		for e in G.edges():
			if((e[0] == v) or (e[1] == v)):
				if(numtriangles(G, e) < (numtri - 1)):
					break;
				else:
					numtriedge = numtriedge + 1;
		if(numtriedge == G.degree(v)):
			numverttri = numverttri + 1;
			break;
	if(numverttri >= 2):
		print "Found a graph such that at least two vertices with incident edges belonging to at least " + str(numtri) + " triangles at position " + str(position);