About: http://webisa.webdatacommons.org/400516895

Property	Value
http://www.w3.org/1999/02/22-rdf-syntax-ns#type	http://www.w3.org/ns/prov#Entity
http://www.w3.org/ns/prov#value	For the second part, divide the $k$ people into $k/2=n+1$ pairs and let the two people in each pair not be friends, while everybody is a friend with all those people they are not paired with.
http://www.w3.org/ns/prov#wasQuotedFrom	stackexchange.com