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

Revision history for BP390

Displaying 1-4 of 4 results found. page 1
     Edits shown per page: 25.
BP390 on 2020-07-03 12:42:03 by Aaron David Fairbanks                approved
+DATA

 

EX4664
   

EX4665
   

EX4666
   

EX4667
   

EX4668
   

EX4669
 

-DATA

 

EX4670
   

EX4671
   

EX4672
   

EX4673
   

EX4674
   

EX4675
 

BP390 on 2020-07-02 22:58:04 by Aaron David Fairbanks                approved
NAME

Each graph vertex is uniquely defined by its connections (the graph does not admit nontrivial automorphisms) vs. the graph admits nontrivial automorphisms.

COMMENTS

EXAMPLE

AUTHOR

Jago Collins

BP390 on 2020-07-02 02:47:10 by Aaron David Fairbanks                approved
NAME

COMMENTS

REFERENCE

CROSSREFS

EXAMPLE

AUTHOR


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