Forcing finite minors in sparse infinite graphs by large-degree assumptions (Q2260615)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6413647
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Forcing finite minors in sparse infinite graphs by large-degree assumptions |
scientific article; zbMATH DE number 6413647 |
Statements
Forcing finite minors in sparse infinite graphs by large-degree assumptions (English)
0 references
11 March 2015
0 references
Summary: Developing further Stein's recent notion of relative end degrees in infinite graphs, we investigate which degree assumptions can force a locally finite graph to contain a given finite minor, or a finite subgraph of given minimum or average degree. This is part of a wider project which seeks to develop an extremal theory of sparse infinite graphs.
0 references
relative end degrees in infinite graphs
0 references
density
0 references
forcing minors
0 references
extremal theory of sparse infinite graphs
0 references
0 references
0.8853102922439575
0 references
0.8497377038002014
0 references
0.7862550616264343
0 references
0.7784975171089172
0 references
0.7700040936470032
0 references
