Search: keyword:both
|
Displaying 1-7 of 7 results found.
|
page 1
|
|
Sort:
id
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
BP328 |
| All sides are equal vs. all angles are equal. |
|
| |
|
|
|
|
|
BP339 |
| Union of left sets is right set vs. intersection of left sets is right set. |
|
| |
|
|
|
|
|
BP345 |
| Intersection of circle and square vs. union of circle and square. |
|
| |
|
|
|
|
|
BP932 |
| Every vertex is connected to every other vs. vertices are connected in a cycle (no other connections). |
|
| ?
| ?
|
|
|
|
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
|
|
|
|
|
BP961 |
| Includes itself on the left vs. includes itself on the right. |
|
| |
|
|
COMMENTS
|
Some examples are Bongard Problems with this solution. |
|
CROSSREFS
|
Adjacent-numbered pages:
BP956 BP957 BP958 BP959 BP960  *  BP962 BP963 BP964 BP965 BP966
|
|
KEYWORD
|
nice, precise, dual, handed, leftright, perfect, infinitedetail, both, neither, preciseworld
|
|
CONCEPT
|
fractal (info | search), recursion (info | search), self-reference (info | search)
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
| |
|
|
|
|
|