More on the extremal number of subdivisions (Q2236656)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: More on the extremal number of subdivisions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More on the extremal number of subdivisions |
scientific article |
Statements
More on the extremal number of subdivisions (English)
0 references
25 October 2021
0 references
For a graph \(H\), the extremal number, ex(\(n,H\)), is the maximal number of edges in an \(H\)-free graph on \(n\) vertices. The authors present more precise bounds for the extremal number in bipartite graphs, settling some previous conjectures.
0 references
extremal numbers
0 references
bipartite graphs
0 references
subdivision
0 references
0.8487545847892761
0 references
0.8273565173149109
0 references
0.8255426287651062
0 references
0.8240112066268921
0 references
0.8186300992965698
0 references
