login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: +meta:BP1023
Displaying 11-14 of 14 results found. ( prev )     page 1 2
     Sort: id      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
BP1100 There is a path between any two nodes vs. not so.
(edit; present; nest [left/right]; search; history)
REFERENCE

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

https://en.wikipedia.org/wiki/Connectivity_(graph_theory)

CROSSREFS

Adjacent-numbered pages:
BP1095 BP1096 BP1097 BP1098 BP1099  *  BP1101 BP1102 BP1103 BP1104 BP1105

KEYWORD

precise, allsorted, world, preciseworld

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

WORLD

graph [smaller | same | bigger]
zoom in left (connected_graph) | zoom in right (disconnected_graph)

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

BP1102 Nodes share the same edge connections as the vertices of a cube vs. not so.
(edit; present; nest [left/right]; search; history)
REFERENCE

https://mathworld.wolfram.com/CubicalGraph.html

CROSSREFS

Adjacent-numbered pages:
BP1097 BP1098 BP1099 BP1100 BP1101  *  BP1103 BP1104 BP1105 BP1106 BP1107

KEYWORD

precise, allsorted, arbitrary, help, preciseworld

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

WORLD

connected_graph [smaller | same | bigger]

AUTHOR

Leo Crabbe

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

https://mathworld.wolfram.com/Edge-TransitiveGraph.html

CROSSREFS

Adjacent-numbered pages:
BP1104 BP1105 BP1106 BP1107 BP1108  *  BP1110 BP1111 BP1112 BP1113 BP1114

KEYWORD

precise, allsorted, notso, math, left-narrow, preciseworld

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

WORLD

graph [smaller | same | bigger]

AUTHOR

Leo Crabbe

( prev )     page 1 2

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