
We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.
41 pages, 16 figures
Extremal problems in graph theory, Connectivity, Extremal graph theory, Minimal k-connectivity, Infinite graph, extremal graph theory, infinite graph, degree, Theoretical Computer Science, Minor, minimal \(k\)-connectivity, Infinite graphs, minor, Degree, connectivity, FOS: Mathematics, Minimum degree, Research exposition (monographs, survey articles) pertaining to combinatorics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Combinatorics (math.CO), minimum degree
Extremal problems in graph theory, Connectivity, Extremal graph theory, Minimal k-connectivity, Infinite graph, extremal graph theory, infinite graph, degree, Theoretical Computer Science, Minor, minimal \(k\)-connectivity, Infinite graphs, minor, Degree, connectivity, FOS: Mathematics, Minimum degree, Research exposition (monographs, survey articles) pertaining to combinatorics, Discrete Mathematics and Combinatorics, Mathematics - Combinatorics, Combinatorics (math.CO), minimum degree
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
