The On-Line Encyclopedia of Bongard Problems

Search: ex:EX4664

Displaying 1-1 of 1 result found.

page 1

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

Each graph vertex is uniquely defined by its connections (the graph does not admit nontrivial automorphisms) vs. the graph admits nontrivial automorphisms.

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

	CROSSREFS	`Adjacent-numbered pages: BP385 BP386 BP387 BP388 BP389 * BP391 BP392 BP393 BP394 BP395`
	KEYWORD	`precise, allsorted, notso, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `self-reference (info \| search),` `topological_transformation (info \| search),` `imagined_shape (info \| search),` `imagined_entity (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

page 1

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