login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
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

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