The On-Line Encyclopedia of Bongard Problems

Search: -meta:BP550

Displaying 371-380 of 433 results found.

( prev | next ) page 1 ... 34 35 36 37 38 39 40 41 42 43 44

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

BP560

There exists a closed trail that hits each edge exactly once vs. not so.

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

	COMMENTS	`Left examples are called "Eulerian graphs."` `A connected graph is Eulerian if and only if each vertex is incident to an even number of edges.`
	CROSSREFS	`Adjacent-numbered pages: BP555 BP556 BP557 BP558 BP559 * BP561 BP562 BP563 BP564 BP565`
	KEYWORD	`precise, allsorted, math, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `all (info \| search),` `even_odd (info \| search),` `existence (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP562

There exists a closed trail that hits each vertex exactly once vs. not so.

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

	COMMENTS	`Left examples are called "Hamiltonian graphs."`
	CROSSREFS	`Adjacent-numbered pages: BP557 BP558 BP559 BP560 BP561 * BP563 BP564 BP565 BP566 BP567`
	KEYWORD	`math, traditional`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP576

Vertices may be partitioned into two sets such that no two vertices in the same set are connected versus not so.

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

	COMMENTS	`Left examples are called "bipartite graphs."`
	CROSSREFS	`Adjacent-numbered pages: BP571 BP572 BP573 BP574 BP575 * BP577 BP578 BP579 BP580 BP581`
	KEYWORD	`precise, allsorted, notso, math, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search)`
	WORLD	`graph [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP788

Graph contains a "loop" a.k.a. cycle (cyclic) versus graph is acyclic.

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

	CROSSREFS	`Adjacent-numbered pages: BP783 BP784 BP785 BP786 BP787 * BP789 BP790 BP791 BP792 BP793`
	KEYWORD	`nice, precise, allsorted, math, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `loop (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP790

The leftmost two add (as vectors) to the right versus no two add to a third.

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

	CROSSREFS	`Adjacent-numbered pages: BP785 BP786 BP787 BP788 BP789 * BP791 BP792 BP793 BP794 BP795`
	KEYWORD	`math, structure, orderedtriplet, traditional`
	CONCEPT	`addition (info \| search),` `2_inputs_1_output (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP791

The leftmost two angles measured from thin line add to the rightmost versus no two angles add to a third.

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

	COMMENTS	`This answer is independent of whether angles are measured clockwise or counter-clockwise; only a consistent choice must be made.`
	CROSSREFS	`Adjacent-numbered pages: BP786 BP787 BP788 BP789 BP790 * BP792 BP793 BP794 BP795 BP796`
	KEYWORD	`math, structure, orderedtriplet, traditional`
	CONCEPT	`addition (info \| search),` `2_inputs_1_output (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP809

Figures can be transformed into one another by smooth stretching (before and after there are the same crossroad-points; there is a curve connecting points before if and only if there is a curve connecting those points after) vs. not so.

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

	COMMENTS	`Left examples are topologically homeomorphic figures.` `For some examples one can imagine pulling the shape "out of" the 2d square in 3d in order to transform it, and then laying it flat back in the 2d square. See BP810 for the version where this is not allowed.`
	CROSSREFS	`Adjacent-numbered pages: BP804 BP805 BP806 BP807 BP808 * BP810 BP811 BP812 BP813 BP814`
	KEYWORD	`nice, math, unorderedpair, traditional`
	CONCEPT	`topological_transformation (info \| search)`
	WORLD	`two_figures_made_of_curves [smaller \| same \| bigger] zoom in left (two_homeomorphic_figures_made_of_curves)`
	AUTHOR	`Aaron David Fairbanks`

BP810

Figures can be transformed into one another by smooth stretching (intersection points stay constant; paths connecting those points remain), while remaining within the 2d box vs. movement out of the plane required.

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

	CROSSREFS	`All examples here fit left in BP809, a version where the figures are allowed to pass through themselves while being deformed.` `Adjacent-numbered pages: BP805 BP806 BP807 BP808 BP809 * BP811 BP812 BP813 BP814 BP815`
	KEYWORD	`nice, math, unorderedpair, traditional`
	CONCEPT	`topological_transformation (info \| search)`
	WORLD	`two_homeomorphic_figures_made_of_curves [smaller \| same \| bigger]`
	AUTHOR	`Aaron David Fairbanks`

BP839

Opposite (inverse) transformations have been applied to the same specific small square on opposite sides of the dividing line versus not so.

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

	COMMENTS	`The original pre-transformed square is the same across all examples, however it is not shown in most examples; what the pre-transformed square looks like must be deduced by the solver.`
	CROSSREFS	`BP1260 is about applying the same transformation to different objects.` `Adjacent-numbered pages: BP834 BP835 BP836 BP837 BP838 * BP840 BP841 BP842 BP843 BP844`
	KEYWORD	`easy, abstract, arbitrary, anticomputer, traditional, rules`
	CONCEPT	`square (info \| search),` `specificity (info \| search),` `function (info \| search)`
	AUTHOR	`Aaron David Fairbanks`

BP840

Any transformation (rotation or flip) that sends one L to another L sends each L to some other L versus not so.

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

	COMMENTS	`Restriction of BP841 to these axis-aligned L-shapes.` `Left examples represent subgroups of the dihedral group D4.`
	CROSSREFS	`Adjacent-numbered pages: BP835 BP836 BP837 BP838 BP839 * BP841 BP842 BP843 BP844 BP845`
	KEYWORD	`traditional`
	WORLD	`zoom in left \| zoom in right`
	AUTHOR	`Aaron David Fairbanks`

( prev | next ) page 1 ... 34 35 36 37 38 39 40 41 42 43 44

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