Name
Abstract | ||
|---|---|---|
We describe the relationship between minors in graphs, subdivisions of the 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? |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1016/S1571-0653(05)80190-8 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Contraction,minor,subdivision,linking,extremal | Graph,Discrete mathematics,Combinatorics,Subdivision,Extremal combinatorics,Extremal graph theory,Mathematics | Journal |
Volume | ISSN | Citations |
5 | 1571-0653 | 1 |
PageRank | References | Authors |
0.37 | 3 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew Thomason | 1 | 71 | 16.01 |