All Questions
Tagged with matching-theory permutations
6
questions
1
vote
2
answers
180
views
Pairing cartesian coordinates for minimum distance
I have n start locations, defined by their x,y coordinates on a two-dimensional plane.
I have a further n destination locations (again, as x,y coordinates) that differ from the start locations.
All ...
- 13
1
vote
1
answer
267
views
Permutations with matching
Suppose that I have the set $S=\{1,2,3,4,5\}$. I will label the elements as $S_i$ where $i=1,…,5$. So, for example, $S_1=1, S_2=2$ and so on. I call $\tilde{S}^k$ Any permutation of $S$ for $k=1,…,5!$....
- 640
0
votes
2
answers
466
views
Trying to calculate matches in a tournament using combinations, in games that have multiple players
I am trying to calculate opponents in matches for my app game.
In it I will have a league of a varied number (between 5-14) of players and I want to know, given the number of players in a league, what'...
- 133
8
votes
1
answer
600
views
Bipartite graphs from permutations
Given are $n\geq 1$ permutations of $abcd$. We construct a bipartite graph $G_{a,b}$ as follows: The $n$ vertices on one side are labeled with the sets containing $a$ and the letters after it in each ...
- 7,194
2
votes
1
answer
133
views
Bipartite graph which number of complete matching is $1$, has at least one $degree=1$ vertex?
There is a bipartite graph $G = (U, V, E)$ which is $|U| = |V|$, and the number of complete matching is only $1$.
Is this graph always contain at least $1$ vertex that $deg(v) = 1 \ (v \in V)$?
If so, ...
- 565
4
votes
1
answer
318
views
Complexity of counting the number of Good-perfect matching in bipartite graph
Let's $G=(U, V, E)$ be a balanced bipartite graph which $|U|=|V|=n$ and $|E|=n*(n-1)$; All nodes in $U$ are connected to all nodes in $V$ except $u_i$ to $v_i$ for $1\leq i \leq n$.
Definition1: ...
user5409