The On-Line Encyclopedia of Bongard Problems

Search: ex:EX10315

Displaying 1-1 of 1 result found.

page 1

Sort: id Format: long Filter: (all | no meta | meta) Mode: (words | no words)

If two nodes are linked, they are each linked to a different number of nodes vs. not so.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://en.wikipedia.org/wiki/Highly_irregular_graph`
	CROSSREFS	`Adjacent-numbered pages: BP1278 BP1279 BP1280 BP1281 BP1282 * BP1284 BP1285 BP1286 BP1287 BP1288`
	CONCEPT	`graph (info \| search)`
	AUTHOR	`Leo Crabbe`

page 1

		Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)