The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Let P and Q be, respectively, hereditary and cohereditary properties defined on the subsets of a finite set S. We first prove that several functions related to P and Q interpolate over some families of subsets of S. By using this we then derive a number of interpolation results for graphs, hypergraphs and matroids.
We give a general Harper-type lower bound for the bandwidth of a graph which is a common generalization of several known results. As applications we get a lower bound for the bandwidth of the composition of two graphs. By using this we determine the bandwidths of some composition graphs such as (P r P s )[H], (P r C s )[H] (2r ≠ s), (C r C s )[H] (6...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.