Step 1: Model the situation as a bipartite graph.
Think of each interaction between an AXIAL member and a BELIANCE member as an edge connecting them. We are given the number of interactions (degree) of certain people on both sides.
Step 2: Count total interactions from the BELIANCE side.
Let n be the total number of BELIANCE members at the party. Of these, 3 members interacted with 4 AXIAL members each, giving \(3 \times 4 = 12\) interactions. The remaining \((n-3)\) members interacted with 2 AXIAL members each, giving \(2(n-3)\) interactions. So the total interactions, counted from the BELIANCE side, is
\[
12 + 2(n-3) = 2n + 6
\]
Step 3: Bound the total interactions from the AXIAL side.
There are 8 AXIAL members, and no AXIAL member interacted with more than 3 BELIANCE members. So the total interactions, counted from the AXIAL side, is at most \(8 \times 3 = 24\).
Step 4: Equate and solve, since both sides count the same interactions.
\[
2n + 6 \leq 24
\]
\[
2n \leq 18
\]
\[
n \leq 9
\]
Step 5: Check that n = 9 is actually achievable.
At n = 9, the total interactions equal exactly 24, so each of the 8 AXIAL members must interact with exactly 3 BELIANCE members, the maximum allowed. This can be arranged by spreading the connections evenly among the 9 BELIANCE members, so n = 9 is a genuine maximum, not just a theoretical bound.
Final Answer:
The greatest possible number of BELIANCE members is
\[ \boxed{9} \]