The On-Line Encyclopedia of Bongard Problems

Search: subworld:graph

Displaying 1-10 of 17 results found.

( next ) page 1 2

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

BP51

Two circles close to each other vs. no two circles close to each other.

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

	REFERENCE	`M. M. Bongard, Pattern Recognition, Spartan Books, 1970, p. 230.`
	CROSSREFS	`Adjacent-numbered pages: BP46 BP47 BP48 BP49 BP50 * BP52 BP53 BP54 BP55 BP56`
	KEYWORD	`nice, finished, traditional, bongard`
	CONCEPT	`near_far (info \| search)`
	WORLD	`four_dot_outlines [smaller \| same \| bigger]`
	AUTHOR	`Mikhail M. Bongard`

BP66

Unconnected circles on a horizontal line vs. unconnected circles on a vertical line.

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

	REFERENCE	`M. M. Bongard, Pattern Recognition, Spartan Books, 1970, p. 235.`
	CROSSREFS	`Adjacent-numbered pages: BP61 BP62 BP63 BP64 BP65 * BP67 BP68 BP69 BP70 BP71`
	KEYWORD	`noisy, finished, traditional, bongard`
	CONCEPT	`collinear (info \| search),` `horizontal (info \| search),` `on_line_or_curve (info \| search),` `shape_cluster (info \| search),` `cluster (info \| search),` `vertical (info \| search)`
	WORLD	`[smaller \| same \| bigger]`
	AUTHOR	`Mikhail M. Bongard`

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)

	CROSSREFS	`Adjacent-numbered pages: BP386 BP387 BP388 BP389 BP390 * BP392 BP393 BP394 BP395 BP396`
	KEYWORD	`nice, precise, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `existence (info \| search),` `imagined_shape (info \| search),` `imagined_entity (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

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`

BP854

Nothing vs. nothing.

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

	CROSSREFS	`Adjacent-numbered pages: BP849 BP850 BP851 BP852 BP853 * BP855 BP856 BP857 BP858 BP859`
	KEYWORD	`left-finite, right-finite, left-full, right-full, finished, experimental, funny`
	WORLD	`nothing [same \| bigger] zoom in left (nothing) \| zoom in right (nothing)`
	AUTHOR	`Aaron David Fairbanks`

BP905

Graph can be redrawn such that no edges intersect vs. not so.

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

	COMMENTS	`A graph is a collection of vertices and edges. Vertices are the dots and edges are the lines that connect the dots. On the left, all edges can be redrawn (curved lines are allowed and moving vertices is allowed) such that no edges cross each other and each vertex is still connected to the same other vertices. These graphs are called planar.`
	CROSSREFS	`Adjacent-numbered pages: BP900 BP901 BP902 BP903 BP904 * BP906 BP907 BP908 BP909 BP910`
	KEYWORD	`nice, precise, allsorted, notso, math, left-null, preciseworld`
	CONCEPT	`graph (info \| search),` `topological_transformation (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Molly C Klenzak`

( next ) page 1 2

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