login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: supworld:planar_connected_graph
Displaying 11-20 of 24 results found. ( prev | next )     page 1 2 3
     Sort: id      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
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

BP867 Bongard Problem with solution that can be naturally expressed as "___ vs. not so" vs. not so.
BP32
BP77
BP82
BP127
BP243
BP257
BP274
BP288
BP323
BP344
BP376
BP381
BP385
BP390
BP506
BP507
BP515
BP516
BP538
BP541
BP542
BP544
BP545
BP553
BP559
BP569
BP576
BP812
BP816
BP818
BP823
BP825
BP852
BP866
BP867

. . .

BP6

Qat

blimp

notso

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

Left-sorted BPs have the keyword "notso" on the OEBP.


This meta Bongard Problem is about Bongard Problems featuring two rules that are conceptual opposites.


Sometimes both sides could be seen as the "not" side: consider, for example, two definitions of the same Bongard Problem, "shape has hole vs. does not" and "shape is not filled vs. is". It is possible (albeit perhaps unnatural) to phrase the solution either way when the left and right sides partition all possible relevant examples cleanly into two groups (see the allsorted keyword).


When one property is "positive-seeming" and its opposite is "negative-seeming", it usually means the positive property would be recognized without counter-examples (e.g. a collection of triangles will be seen as such), while the negative property wouldn't be recognized without counter-examples (e.g. a collection of "non-triangle shapes" will just be interpreted as "shapes" unless triangles are shown opposite them).


BP513 (keyword left-narrow) is about Bongard Problems whose left side can be recognized without the right side. When a Bongard Problem is left-narrow and not "right-narrow that usually makes the property on the left seem positive and the property on the right seem negative.


The OEBP by convention has preferred the "positive-seeming" property (when there is one) to be on the left side.


All in all, the keyword "notso" should mean:

1) If the Bongard Problem is "narrow" on at least one side, then it is left-narrow.

2) The right side is the conceptual negation of the left side.


If a Bongard Problem's solution is "[Property A] vs. not so", the "not so" side is everything without [Property A] within some suitable context. A Bongard Problem "triangles vs. not so" might only include simple shapes as non-triangles; it need not include images of boats as non-triangles. It is not necessary for all the kitchen sink to be thrown on the "not so" side (although it is here).

CROSSREFS

See BP1001 for a version sorting pictures of Bongard Problems (miniproblems) instead of links to pages on the OEBP. (This version is a little different. In BP1001, the kitchen sink of all other possible images is always included on the right "not so" side, rather than a context-dependent conceptual negation.)


Contrast keyword viceversa.


"[Property A] vs. not so" Bongard Problems are often allsorted, meaning they sort all relevant examples--but not always, because sometimes there exist ambiguous border cases, unclear whether they fit [Property A] or not.

Adjacent-numbered pages:
BP862 BP863 BP864 BP865 BP866  *  BP868 BP869 BP870 BP871 BP872

KEYWORD

notso, meta (see left/right), links, keyword, left-self, funny

WORLD

everything [smaller | same]
zoom in left

AUTHOR

Aaron David Fairbanks

BP902 This Bongard Problem vs. anything else.
BP902
BP1

becious

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

Although this Bongard Problem is self-referential, it's only because of the specific phrasing of the solution. "BP902 vs. anything else" would also work. The number 902 could have been chosen coincidentally.

CROSSREFS

See BP953, BP959.

Adjacent-numbered pages:
BP897 BP898 BP899 BP900 BP901  *  BP903 BP904 BP905 BP906 BP907

KEYWORD

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

CONCEPT self-reference (info | search),
specificity (info | search)

WORLD

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

AUTHOR

Leo Crabbe

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

BP932 Every vertex is connected to every other vs. vertices are connected in a cycle (no other connections).
?
?
(edit; present; nest [left/right]; search; history)
COMMENTS

Complete graphs with zero, one, two, or three vertices would be ambiguously categorized (fit in overlap of both sides).


Left examples are called "fully connected graphs." Right examples are called "cycle graphs."

CROSSREFS

Adjacent-numbered pages:
BP927 BP928 BP929 BP930 BP931  *  BP933 BP934 BP935 BP936 BP937

KEYWORD

precise, left-narrow, right-narrow, both, preciseworld

CONCEPT graph (info | search),
distinguishing_crossing_curves (info | search),
all (info | search),
loop (info | search)

WORLD

connected_graph [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1016 Rigid vs. not rigid.
(edit; present; nest [left/right]; search; history)
REFERENCE

Henneberg, L. (1911), Die graphische Statik der starren Systeme, Leipzig

Jackson, Bill. (2007). Notes on the Rigidity of Graphs.

Laman, Gerard. (1970), "On graphs and the rigidity of plane skeletal structures", J. Engineering Mathematics, 4 (4): 331–340.

Pollaczek‐Geiringer, Hilda (1927), "Über die Gliederung ebener Fachwerke", Zeitschrift für Angewandte Mathematik und Mechanik, 7 (1): 58–72.

CROSSREFS

Adjacent-numbered pages:
BP1011 BP1012 BP1013 BP1014 BP1015  *  BP1017 BP1018 BP1019 BP1020 BP1021

KEYWORD

nice, physics, help

CONCEPT rigidity (info | search),
graph (info | search),
imagined_motion (info | search)

WORLD

planar_connected_graph [smaller | same | bigger]
zoom in left (rigid_planar_connected_graph)

AUTHOR

Aaron David Fairbanks

BP1022 Nesting vs. no nesting.
(edit; present; nest [left/right]; search; history)
CROSSREFS

See BP1061 for a version of this with only squares and which allows infinite nesting.

See BP71 for a Problem about counting levels of nesting.

Adjacent-numbered pages:
BP1017 BP1018 BP1019 BP1020 BP1021  *  BP1023 BP1024 BP1025 BP1026 BP1027

KEYWORD

easy, nice, precise, allsorted, traditional

CONCEPT recursion_number (info | search),
separated_regions (info | search),
inside (info | search),
recursion (info | search)

WORLD

varied_thickness_curves_drawing [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1099 Considering only the ways they are connected, anything that can be said about a given node can be said about every other node vs. not so.
(edit; present; nest [left/right]; search; history)
REFERENCE

https://en.wikipedia.org/wiki/Vertex-transitive_graph

CROSSREFS

Adjacent-numbered pages:
BP1094 BP1095 BP1096 BP1097 BP1098  *  BP1100 BP1101 BP1102 BP1103 BP1104

KEYWORD

precise, allsorted, notso, math, preciseworld

CONCEPT graph (info | search),
distinguishing_crossing_curves (info | search)

WORLD

graph [smaller | same | bigger]
zoom in left

AUTHOR

Leo Crabbe

( prev | 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