The On-Line Encyclopedia of Bongard Problems

Search: BP1100

Displaying 1-2 of 2 results found.

page 1

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

BP1100

There is a path between any two nodes vs. not so.

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

	REFERENCE	`https://en.wikipedia.org/wiki/Graph_theory` `https://en.wikipedia.org/wiki/Connectivity_(graph_theory)`
	CROSSREFS	`Adjacent-numbered pages: BP1095 BP1096 BP1097 BP1098 BP1099 * BP1101 BP1102 BP1103 BP1104 BP1105`
	KEYWORD	`precise, allsorted, world, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `connected_component (info \| search)`
	WORLD	`graph [smaller \| same \| bigger] zoom in left (connected_graph) \| zoom in right (disconnected_graph)`
	AUTHOR	`Leo Crabbe`

BP1139

Bongard Problems where, given any example, there is a way to add details to it (without erasing) such that it is sorted on the other side vs. BPs where this is not the case.

BP35

BP50

BP62

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