The text I was reading states:
An n-node graph is said to be tangled if there is an edge leaving every set of [n/3] or fewer vertices. As a special case, the graph consisting of a single node is considered tangled. (Recall that the notation [x] refers to the smallest integer greater than or equal to x.)
Can someone explain to me what this means? what is tangled graph?