HOME | DD

Description

I am offering my compiled example for one of the proved theorems in a field of discrete mathematics/ graph theory - field of study of definite, expressed in relations of natural numbers mathematical structures and abstractions. One theorem for so called road coloring problem waited its approval and validation for 38 years. A man named Abraham Trahtman, Israel-born former soviet union mathematician, offered one of concise and formally strict (and not just intuitive) proof of possibility to exist such mathematical structural networks which obey mathematically logical principals and who's properties enables them to be deciphered, a "key" found to their structure.
I draw this as an exercise to see for myself proved theorem in action, so following a theorem's described necessary properties of such network, i tried to pull off a graph/ network with 24 crossroad points...
As i found out - it works flawlessly :l
Blue-Blue-Yellow-Blue is the code to hold on to for getting out of the labyrinth from any of its point.
If one come to think of it - that mysterious dweller, a lost soul in such labyrinth ,to whom such code BBYB (and alike)
may be transmitted, may in various situations in real life, maybe, mean various different things. In one case, that might
be essential part of the algorithm for the virus that travels along your computers memory, it may be a part of design of
logisticts or data flow nerve system, or it may be many more other things and events in our bizarre, dynamic, turbulent
physical reality.
Proved theorem goes more deeper into the subject, treating it with strict discipline. Who happens to be interested - all doors open to you in the age of the Internet.
- - - - - - - - - - - - - - - -
Сообщите заблудившемусья муравейчику
в лабиринте перекрестков 4-дорог,
"иди по синей-синей-желто-синей",
и выйдет муравейчик из всех фейковых дорог.

(Intars, 11.January 2019)

Description

I am offering my compiled example for one of the proved theorems in a field of discrete mathematics/ graph theory - field of study of definite, expressed in relations of natural numbers mathematical structures and abstractions. One theorem for so called road coloring problem waited its approval and validation for 38 years. A man named Abraham Trahtman, Israel-born former soviet union mathematician, offered one of concise and formally strict (and not just intuitive) proof of possibility to exist such mathematical structural networks which obey mathematically logical principals and who's properties enables them to be deciphered, a "key" found to their structure.
I draw this as an exercise to see for myself proved theorem in action, so following a theorem's described necessary properties of such network, i tried to pull off a graph/ network with 24 crossroad points...
As i found out - it works flawlessly :l
Blue-Blue-Yellow-Blue is the code to hold on to for getting out of the labyrinth from any of its point.
If one come to think of it - that mysterious dweller, a lost soul in such labyrinth ,to whom such code BBYB (and alike)
may be transmitted, may in various situations in real life, maybe, mean various different things. In one case, that might
be essential part of the algorithm for the virus that travels along your computers memory, it may be a part of design of
logisticts or data flow nerve system, or it may be many more other things and events in our bizarre, dynamic, turbulent
physical reality.
Proved theorem goes more deeper into the subject, treating it with strict discipline. Who happens to be interested - all doors open to you in the age of the Internet.
- - - - - - - - - - - - - - - -
Сообщите заблудившемусья муравейчику
в лабиринте перекрестков 4-дорог,
"иди по синей-синей-желто-синей",
и выйдет муравейчик из всех фейковых дорог.

(Intars, 11.January 2019)