login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)

Revision history for BP1109

Displaying 1-12 of 12 results found. page 1
     Edits shown per page: 25.
BP1109 on 2021-02-01 15:55:40 by Jago Collins                approved
+DATA

 

EX9001
 

BP1109 on 2021-02-01 14:55:04 by Leo Crabbe                approved
NAME

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.

COMMENTS

EXAMPLE

BP1109 on 2021-02-01 14:50:22 by Leo Crabbe                approved
NAME

Anything that can be said about a given edge can be said about every other edge vs. not so.

COMMENTS

EXAMPLE

BP1109 on 2021-01-31 00:06:47 by Leo Crabbe                approved
+DATA

 

EX8999
 

REMOVE

 

EX6507
 

BP1109 on 2021-01-30 23:47:11 by Leo Crabbe                approved
+DATA

 

EX6507
 

BP1109 on 2021-01-30 23:45:10 by Leo Crabbe                approved
+DATA

 

EX8995
   

EX6529
   

EX8996
   

EX8997
   

EX6508
   

EX6536
 

-DATA

 

EX8998
   

EX8373
   

EX4670
   

EX6524
   

EX6532
   

EX8936
 

BP1109 on 2021-01-30 23:44:40 by Leo Crabbe                approved
REMOVE

 

MY1

   

MY2

   

MY3

   

MY6

   

MY5

   

MY4

   

MY11

   

MY12

   

MY7

   

MY8

   

MY9

   

MY10

 

BP1109 on 2021-01-30 23:43:26 by Leo Crabbe                approved
NAME

No edge can be distinguished from any other based on the edge connections between vertices vs. not so.

COMMENTS

REFERENCE

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

EXAMPLE

AUTHOR

Leo Crabbe

+DATA

 

EX6506
   

EX6262
   

EX6501
   

MY1

   

MY2

   

MY3

   

MY4

   

MY5

   

MY6

 

-DATA

 

EX6512
   

EX6509
   

MY7

   

MY8

   

MY9

   

MY10

   

MY11

   

MY12

 


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