Skip to main content

All Questions

1 question with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
1 vote
0 answers
22 views

Topology of densest graphs whose optimal $3D$-matching can be calculated efficiently

let $A=\lbrace a_1,\,\dots,\,a_k\rbrace $ and $B=\lbrace b_1,\,\dots,\,b_{2k}\rbrace,\ A\cap B=\emptyset$ be be a partition of a graph's vertex set $V$, i.e. $V\,=\,A\cup B$. Question: has $G:=\...
Manfred Weis's user avatar
  • 13.2k