Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
75 views

Optimal perfect matchings in magic squares

Question: what is known about minimum/maximum weight perfect matchings in magic squares with or without special properties like e.g. being pandiagonal? I am especially interested minimal/maximal ...
Manfred Weis's user avatar
  • 13.2k
6 votes
1 answer
252 views

Pair matching between divisors less and more than $\sqrt{N}$

Let $n$ be the positive integer. Let $A$ and $B$ be sets of divisors of $n$ less and more than $\sqrt{n}$ respectively. Consider bipartite graph $(A, B)$, where two vertices are connected when one ...
thematdev's user avatar
  • 163
1 vote
1 answer
110 views

Succinct polynomial sized representation of balanced bipartite graphs whose perfect matching count is a primorial

Is there a $P$ time definable sequence of succinct polynomial sized representation of balanced bipartite graphs whose number of perfect matchings is a primorial? For factorial a complete bipartite ...
Turbo's user avatar
  • 13.9k
3 votes
1 answer
377 views

Minimum planar bipartite graph to cover all perfect matching count

Given set $\mathcal T_n=\{0,1,\dots,2^n-1\}$ what is the minimum number of vertices $2m$ needed in a planar bipartite balanced graph such that at every $i\in\mathcal T_n$ there is a graph $G\in\...
Turbo's user avatar
  • 13.9k