3 papers
math.CO2017
On Perfect Matchings in Matching Covered Graphs
Jinghua He, Erling Wei, Dong Ye +1
Let be a matching-covered graph, i.e., every edge is contained in a perfect matching. An edge subset of is feasible if there exists two perfect matchings and $M_2…
math.CA2000
A New Convexity Result and the Multiple Access Channel
Shaohui Zhai
We compute the capacity region of the s-sender Multiple Access Adder Channel in information theory and obtain an explicit description of this region as only one polyhedron, instead…
math.CO2000
Search for Three Forged Coins
Shaohui Zhai
Suppose we are given a set of t coins which look identical, but a known number s of them are counterfeit, with a known weight different from the others. Our problem is to locate th…