Let 𝒟 be a non-trivial simple t-design. For 1 ≤ 𝑠 ≤ 𝑡, we generalize the concept of the incidence graph of 𝒟 and construct a new bipartite regular graph Γ. We obtain that the edge-transitivity of ...
We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan and Weiss (2009). Customers and servers play symmetrical roles.There are finite sets C and S of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results