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

Revision history for BP1283

Displaying 1-9 of 9 results found. page 1
     Edits shown per page: 25.
BP1283 on 2025-02-23 20:40:57 by Leo Crabbe                approved
NAME

If two nodes are linked, they are each linked to a different number of nodes vs. not so.

BP1283 on 2025-02-23 20:38:31 by Leo Crabbe                approved
+DATA

 

EX6536
 

-DATA

 

EX8370
 

BP1283 on 2025-02-23 20:36:39 by Leo Crabbe                approved
+DATA

 

EX4684
   

EX6515
 

-DATA

 

EX6522
   

EX6533
   

EX8367
 

BP1283 on 2025-02-23 20:32:37 by Leo Crabbe                approved
+DATA

 

EX4670
 

BP1283 on 2025-02-23 13:21:39 by Leo Crabbe                approved
NAME

No node is connected to as many nodes as a node it's connected to vs. not so.

REFERENCE

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

AUTHOR

Leo Crabbe

+DATA

 

EX8999
   

EX4665
   

EX4666
   

EX10315
 

-DATA

 

EX6535
   

EX4669
   

EX6536
   

EX4670
 


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