×

Subdivisions, linking, minors, and extremal functions. (English) Zbl 1412.05182

Rusu, Irena (ed.), Proceedings of the 6th international conference on graph theory, Marseille-Luminy, France, August 28–September 2, 2000. Amsterdam: Elsevier. Electron. Notes Discrete Math. 5, 295-298 (2000).
Summary: We describe the relationship between minors in graphs, subdivisions of complete graphs, and linking, discussing recent advances in the determination of the extremal functions for these properties. We focus on the extremal function for complete minors; this can now be determined very precisely, but to what extent it is possible to describe the extremal graphs?
For the entire collection see [Zbl 0974.00033].

MSC:

05C83 Graph minors
05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C35 Extremal problems in graph theory
PDFBibTeX XMLCite
Full Text: Link