login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: BP1099
Displaying 1-2 of 2 results found.     page 1
     Sort: relevance      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
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

BP1101 Each node is connected to the same number of nodes by straight lines vs. not so.
(edit; present; nest [left/right]; search; history)
REFERENCE

https://en.wikipedia.org/wiki/Regular_graph

CROSSREFS

Any left example of BP1099 will be a left example for this BP.

Adjacent-numbered pages:
BP1096 BP1097 BP1098 BP1099 BP1100  *  BP1102 BP1103 BP1104 BP1105 BP1106

KEYWORD

precise, allsorted, preciseworld

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

WORLD

graph [smaller | same | bigger]
zoom in left

AUTHOR

Leo Crabbe

    page 1

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