login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: supworld:planar_connected_graph
Displaying 1-10 of 24 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)
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

BP541 Bongard Problems vs. anything else.
BP1
BP2
BP3
BP4
BP541
BP1073

blllmam

cat

nongard

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

This refers to all Bongard Problem solution ideas. No need to be a particularly well-made or well-defined Bongard Problem.

CROSSREFS

Adjacent-numbered pages:
BP536 BP537 BP538 BP539 BP540  *  BP542 BP543 BP544 BP545 BP546

KEYWORD

notso, meta (see left/right), links, world, left-self, right-null, left-it, feedback

WORLD

everything [smaller | same]
zoom in left (bp)

AUTHOR

Aaron David Fairbanks

BP542 BP Pages on the OEBP vs. anything else.
BP1
BP2
BP3
BP542
BP1073
BP0

nolab

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

Adjacent-numbered pages:
BP537 BP538 BP539 BP540 BP541  *  BP543 BP544 BP545 BP546 BP547

KEYWORD

notso, meta (see left/right), links, oebp, world, left-self, right-null, left-it, feedback

WORLD

everything [smaller | same]
zoom in left (bppage)

AUTHOR

Aaron David Fairbanks

BP544 Everything vs. nothing.

&(%

0

BP1
BP544
BP1073

dog

nothing

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

All ideas and things, with no limits.

CROSSREFS

Adjacent-numbered pages:
BP539 BP540 BP541 BP542 BP543  *  BP545 BP546 BP547 BP548 BP549

KEYWORD

notso, meta (see left/right), links, world, left-self, right-finite, right-full, left-null, left-it, feedback, experimental, funny

CONCEPT existence (info | search)

WORLD

everything [smaller | same]
zoom in left (everything) | zoom in right (nothing)

AUTHOR

Aaron David Fairbanks

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

( next )     page 1 2 3

Welcome | Solve | Browse | Lookup | Recent | Links | Register | Contact
Contribute | Keywords | Concepts | Worlds | Ambiguities | Transformations | Invalid Problems | Style Guide | Goals | Glossary