Decompositions of complete graphs into theta graphs with fewer than ten edges

A theta graph is a graph consisting of three pairwise internally disjoint paths with common end points. Methods for decomposing the complete graph K-nu into theta graphs with fewer than ten edges are given.

Large sets of large sets of Steiner triple systems of order 9

We describe a direct method of partitioning the 840 Steiner triple systems of order 9 into 120 large sets. The method produces partitions in which all of the large sets are isomorphic and we apply the method to each of the two non-isomorphic large sets of STS(9).

Effect of pore-network connectivity on multicomponent adsorption of large molecules

The effect of pore-network connectivity on binary liquid-phase adsorption equilibria using the ideal adsorbed solution theory (LAST) was studied. The liquid-phase binary adsorption experiments used ethyl propionate, ethyl butyrate, and ethyl isovalerate as the adsorbates and commercial activated carbons Filtrasorb-400 and Norit ROW 0.8 as adsorbents. As the single-component isotherm, a modified Dubinin-Radushkevich equation was used. A comparison with experimental data shows that incorporating the connectivity of the pore network and considering percolation processes associated with different molecular sizes of the adsorptives in the mixture, as well as their different corresponding accessibility, can improve the prediction of binary adsorption equilibria using the LAST Selectivity of adsorption for the larger molecule in binary systems increases with an increase in the pore-network coordination number, as well with an increase in the mean pore width and in the spread of the pore-size distribution.