The On-Line Encyclopedia of Bongard Problems

Search: ex:EX4666

Displaying 1-2 of 2 results 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`

BP1283

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!)