论文信息 - Interpolation theorems for graphs, hypergraphs and matroids

Interpolation theorems for graphs, hypergraphs and matroids

Abstract 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.

Sanming Zhou

[1] Y Lin. A SIMPLER PROOF OF INTERPOLATION THEOREM FOR SPANNING TREES , 1985 .

[2] Odile Favaron,et al. Contributions to the theory of domination, independence and irredundance in graphs , 1981, Discret. Math..

[3] Ernest J. Cockayne,et al. An interpolation theorem for partitions which are complete with respect to hereditary properties , 1972 .

[4] Béla Bollobás,et al. On generalised minimal domination parameters for paths , 1990, Discret. Math..

[5] Frank Harary,et al. Classification of interpolation theorems for spanning trees and other families of spanning subgraphs , 1989, J. Graph Theory.

[6] Frank Harary,et al. An interpolation theorem for graphical homomorphisms , 1967 .

[7] D. R. Lick,et al. The Theory and Applications of Graphs. , 1983 .

[8] Seymour Schuster,et al. Interpolation theorem for the number of end-vertices of spanning trees , 1983, J. Graph Theory.

[9] F. Harary. COVERING AND PACKING IN GRAPHS, I. , 1970 .

[10] Frank Harary,et al. Interpolation theorem for diameters of spanning trees , 1983 .

[11] Stephen T. Hedetniemi. Hereditary properties of graphs , 1973 .

[12] F. Harary,et al. On the Tree Graph of a Matroid , 1972 .

[13] László Lovász,et al. Basis graphs of greedoids and two-connectivity , 1985 .