It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
Let Sn denote the symmetric group on [n] = {1, . . . , n}. A family I ⊆ Sn is intersecting if any two elements of I have at least one common entry. It is known that the only int...
ng problem for the SDMG CIOQ switch is abstracted as a bipartite k-matching problem. Using fluid model techniques, we prove that any maximal size k-matching algorithm on an SDMG CI...