Graph Theory - # of lines and combinations?

Watch
Laubarr
Badges: 3
Rep:
?
#1
Report Thread starter 1 year ago
#1
Hello All,

See picture below:
Name:  1000.png
Views: 31
Size:  6.9 KB
There exist an infinite plane with infinite number of dots. For sake of argument, let's assume they are 1 inch away from each other.
Name:  1001.png
Views: 24
Size:  53.2 KB
However, below(on your far left) you can see 3 lines already made. The last line is the yellow one.
What you see on your right, are all combinations of possible moves. Move is defined as structure of lines until you reach an empty dot.
Thus, there are 6 combinations of single line(on top). While on bottom you see 10 combinations. 5 of them moves with 2 lines, and 5 with 3 lines.
Total # of combinations is 16.
So far so good?
Well the basic unsolved questions are:
* Does formula exist to calculate total number of combinations(16 in this case) just by looking at the initial graph of 3 lines?
** Does formula exist to show the breakdown of all combinations (6 for single line, 5 for 2 lines, 5 for 3 lines?
*** is 16 the biggest number of combinations that you can make from 3 line starting configuration? For instance: Try to calculate # of combinations (1 lines, 2 lines, 3 lines) from this initial variation:
Name:  1002.png
Views: 30
Size:  3.8 KB

To not spoil the fun, i will just say there is more than 16. So is this the best solution? How we can prove that this is the best we can do? Obviously we can prove that just by doing all 3 line configurations by hand, but what if we take it to next level? What's the best 4 line configuration and how many combinations it has? How about 5,6.7...(n) ? The tree expands quite rapidly, and also few things need to be explained:

Combinations vs Permutations:

Name:  1003.png
Views: 30
Size:  4.1 KB
Above, there are 4 lines as starting configuration. In this case, there are 36 combinations OR 41 permutations. The reason is because you can go from A > B > C > D or C > B > A > D. Once again, is the a formula to calculate combinations (36) and Permutation(41) from any starting configuration?

Name:  1004.png
Views: 33
Size:  6.5 KB
Notation + Final info to consider:
Name:  1005.png
Views: 26
Size:  29.0 KB

Using above notation, you can notice that each configuration is unique and might have different #s of combinations and or permutations. For example:

Name:  1006.png
Views: 24
Size:  18.3 KB

Anyone with any input, either mechanical or potentially writing a code to get the answers How many combinations/Permutations for each variation with up to 10 lines as a starting configuation, would be greatly appreciated. If your program can handle bigger starting configurations, that's even better!

Thank You and enjoy!
Last edited by Laubarr; 1 year ago
0
reply
mqb2766
Badges: 19
Rep:
?
#2
Report 1 year ago
#2
Could you explain where the question comes from? You've posted it in other places as well.
0
reply
Laubarr
Badges: 3
Rep:
?
#3
Report Thread starter 1 year ago
#3
(Original post by mqb2766)
Could you explain where the question comes from? You've posted it in other places as well.
..
Attached files
Last edited by Laubarr; 9 months ago
0
reply
X

Quick Reply

Attached files
Write a reply...
Reply
new posts
Back
to top
Latest
My Feed

See more of what you like on
The Student Room

You can personalise what you see on TSR. Tell us a little about yourself to get started.

Personalise

Have you made your mind up on your five uni choices?

Yes, and I've sent off my application! (262)
57.46%
I've made my choices but havent sent my application yet (61)
13.38%
I've got a good idea about the choices I want to make (48)
10.53%
I'm researching but still not sure which universities I want to apply to (40)
8.77%
I haven't started researching yet (25)
5.48%
Something else (let us know in the thread!) (20)
4.39%

Watched Threads

View All