You are viewing a single thread.
View all comments
23 points

There’s some Interesting graph theory problem somewhere in here about finding out if a network of N people in M relationships must include at least one gay person.

permalink
report
reply
35 points
*

A relationship graph which requires no gay relationships is called a bigraph (honest, I’m not making this up) or bipartite.

That follows because if you can two color the graph so that edges only connect different colors, you just assign male to one color and female to the other.

This means there’s a tone of mathematical identities describing this. Wikipedia has a good introduction.

https://en.m.wikipedia.org/wiki/Bipartite_graph

permalink
report
parent
reply
5 points

Very neat. But the fun part of this is that if you’re poly/into more than one person, you are now a part of the LGBT group, not the straight one.

Note the above image, where the triangle shape requires that every person be into another person, with the tension being that if it’s cishet, they have to choose only one person.

We aren’t checking to see if a shape with LGBT people works, we know those do. We are checking to see if a cishet triangle is even possible.

permalink
report
parent
reply
9 points

A relationship isn’t LGBT; a person is. A cishet man who has two bi/pan female partners who date each other isn’t LGBT because his partners are queer.

permalink
report
parent
reply
5 points

isn’t cis het an identity, therefore someone could identify as heterosexual an be in a polycule, only fucking members of the opposite sexual.

permalink
report
parent
reply
7 points

Even numbers are pretty easy to solve at least. They can be straight or lgbt.

I posit that any love shape that includes an odd number of participants requires some form of deception, or at least one LGBT person in order to be valid.

permalink
report
parent
reply
0 points

You and I have a different definition of interesting.

permalink
report
parent
reply