[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

View post   
File: 655 KB, 300x168, 1355270307441.gif [View same] [iqdb] [saucenao] [google]
7196004 No.7196004 [Reply] [Original]

Is it possible to draw a loop-free multigraph with degrees 4, 6, 8? I don't think so but need confirmation.

>> No.7196022

>>7196004
Just 2 nodes connected by 4, 6, and 8 edges? It's loop-free.

>> No.7196025

>>7196022
no, 3 nodes
A (degree 4), B (degree 6), C (degree 8)

>> No.7196036

>>7196025
So you want a loop-free multigraph that contains 3 nodes with degrees 4, 6, 8?

>> No.7196037

>>7196036
correct

>> No.7196134

>>7196036
where did you go?

>> No.7196224

bump

>> No.7196250

>>7196025
Connect A with B once, A with C 3 times and B with C five times.

>> No.7196270

>>7196250
holy shit do i feel stupid

how exactly do you figure this out?

>> No.7196282

>>7196270
As the degree of A is 4, there are only 4 possible examples for that proposition. Tried a couple of them and got that example.

>> No.7196310

>>7196282
alright, thanks

>> No.7196353

Two of the three nodes are going to have the same degree no matter what, if there's no loops