The Extremal Function for Complete Minors

2001/03/01 by Andrew Thomason · 9 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Biology #Combinatorics #Computer science #Constant (computer programming) #Discrete mathematics #Extremal graph theory #Function (biology) #Graph #Graph theory and applications #Limits and Structures in Graph Theory #Line graph #Mathematics #Random graph #Voltage graph

paper · pdf · doi:10.1006/jctb.2000.2013

crossref issued 2001/03/01 · crossref published 2001/03/01 · crossref published-print 2001/03/01 · openalex publication_date 2001/03/01 · crossref created 2002/09/18 · crossref deposited 2019/05/08 · openalex created_date 2025/10/10 · crossref indexed 2026/07/13 · openalex updated_date 2026/08/01

Citations

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Lower bound of the hadwiger number of graphs by their average degree
• An extremal function for contractions of graphs
• Quasi-random graphs

Cited by

• Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
• Near-Optimal Algorithms for Maximal Clique Enumeration in Structurally Sparse Graphs
• The Graph Minor Algorithm with Parity Conditions
• Note on coloring graphs without odd-Kk-minors
• Rank-width and tree-width of H-minor-free graphs
• Disproof of the List Hadwiger Conjecture
• Independence number in triangle-free graphs avoiding a minor
• Graph minor [wikipedia]
• Hadwiger number [wikipedia]