Interpolation theorems for graphs, hypergraphs and matroids

DOI10.1016/S0012-365X(97)00173-8zbMath0955.05107MaRDI QIDQ1584241

Sanming Zhou

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

interpolationgraphshypergraphsmatroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items (6)

Unavoidable chromatic patterns in 2‐colorings of the complete graph ⋮ An intermediate value theorem for the decycling numbers of Toeplitz graphs ⋮ Graphs isomorphisms under edge-replacements and the family of amoebas ⋮ Minimum partition of an independence system into independent sets ⋮ A sequential coloring algorithm for finite sets ⋮ Bounding the bandwidths for graphs

Cites Work

• Greedoids
• Contributions to the theory of domination, independence and irredundance in graphs
• On generalised minimal domination parameters for paths
• Hereditary properties of raphs
• An interpolation theorem for partitions which are complete with respect to hereditary properties
• Interpolation theorem for diameters of spanning trees
• Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
• Basis graphs of greedoids and two-connectivity
• Interpolation theorem for the number of end‐vertices of spanning trees
• On $f$-domination number of a graph
• COVERING AND PACKING IN GRAPHS, I.
• On the Tree Graph of a Matroid
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Interpolation theorems for graphs, hypergraphs and matroids