The On-Line Encyclopedia of Bongard Problems

Search: supworld:connected_graph

Displaying 1-10 of 23 results found.

( next ) page 1 2 3

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

BP14

All big individual figures vs. all small individual figures.

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

	COMMENTS	`All examples in this Problem show one or more connected figures made up of lines.` `Some big shapes and some small shapes would be ambiguous.`
	REFERENCE	`M. M. Bongard, Pattern Recognition, Spartan Books, 1970, p. 218.`
	CROSSREFS	`See BP2 for the same idea using one shape.` `Adjacent-numbered pages: BP9 BP10 BP11 BP12 BP13 * BP15 BP16 BP17 BP18 BP19`
	KEYWORD	`fuzzy, size, stable, finished, traditional, bongard`
	CONCEPT	`all (info \| search),` `length_line_or_curve (info \| search),` `size (info \| search)`
	WORLD	`curves_drawing [smaller \| same \| bigger]`
	AUTHOR	`Mikhail M. Bongard`

BP50

Vertical axis of symmetry vs. no axis of symmetry.

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

	REFERENCE	`M. M. Bongard, Pattern Recognition, Spartan Books, 1970, p. 230.`
	CROSSREFS	`BP152 is the same solution (with the sides switched), using connected shapes and without black filling.` `BP1206 was created to be a slightly different version of this: "vertical axis of symmetry vs. no vertical axis of symmetry." (That less specific solution fits this Bongard Problem as well.)` `Adjacent-numbered pages: BP45 BP46 BP47 BP48 BP49 * BP51 BP52 BP53 BP54 BP55`
	KEYWORD	`nice, stretch, left-narrow, finished, traditional, bongard`
	CONCEPT	`symmetry_axis (info \| search),` `symmetry (info \| search)`
	WORLD	`curves_and_fill_shapes_separate_drawing [smaller \| same \| bigger]`
	AUTHOR	`Mikhail M. Bongard`

BP91

Three identical elements vs. four identical elements.

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

	REFERENCE	`M. M. Bongard, Pattern Recognition, Spartan Books, 1970, p. 244.`
	CROSSREFS	`BP1226 is "three identical elements vs. other number of identical elements".` `Adjacent-numbered pages: BP86 BP87 BP88 BP89 BP90 * BP92 BP93 BP94 BP95 BP96`
	KEYWORD	`number, ignoreimperfections, finished, traditional, bongard`
	CONCEPT	`indentation (info \| search),` `on_line_or_curve (info \| search),` `number (info \| search),` `protrusion (info \| search),` `separation_of_joined_objects (info \| search),` `same (info \| search),` `three (info \| search),` `four (info \| search)`
	WORLD	`curves_and_fill_shapes_drawing [smaller \| same \| bigger]`
	AUTHOR	`Mikhail M. Bongard`

BP119

A small correction will result in a single circle vs. no small correction will result in a single circle.

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

	CROSSREFS	`Adjacent-numbered pages: BP114 BP115 BP116 BP117 BP118 * BP120 BP121 BP122 BP123 BP124`
	KEYWORD	`fuzzy, traditional`
	CONCEPT	`existence (info \| search),` `imperfection_small (info \| search)`
	WORLD	`curves_drawing [smaller \| same \| bigger]`
	AUTHOR	`Douglas R. Hofstadter`

BP390

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`

BP391

There exists an edge such that removing it yields two disconnected graphs (i.e., the minimum number of edges whose removal results in two disconnected graphs is 1) vs. the minimum number of edges whose removal results in two disconnected graphs is 2.

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

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