|
|
|
Zarankiewicz Problem: Mathematics, Extremal Graph Theory, Bipartite Graph, Subgraph
|
(Buch) |
Dieser Artikel gilt, aufgrund seiner Grösse, beim Versand als 2 Artikel!
| Lieferstatus: |
 i.d.R. innert 7-14 Tagen versandfertig |
| Veröffentlichung: |
März 2026
|
| Genre: |
Schulbücher |
| ISBN: |
9786131177392 |
|
EAN-Code:
|
9786131177392 |
| Verlag: |
Omniscriptum |
| Einband: |
Kartoniert |
| Sprache: |
English
|
| Dimensionen: |
H 220 mm / B 150 mm / D 6 mm |
| Gewicht: |
161 gr |
| Seiten: |
96 |
| Bewertung: |
Titel bewerten / Meinung schreiben
|
| Inhalt: |
| Please note that the content of this book primarily consists of articles
available from Wikipedia or other free sources online. In the
mathematical field of extremal graph theory, the Zarankiewicz problem
asks how many edges can be added to a bipartite graph while avoiding a
specific bipartite subgraph. Initially, the Polish mathematician K.
Zarankiewicz proposed the problem of determining the maximum number of
edges in an n-vertex graph with no complete bipartite graph K3,3 as a
subgraph, for n ¿ 6; that is, in later notation, he asked for the values
of the function Z3(n). The K¿vári-Sós-Turán theorem gives a bound on the
Zarankiewicz problem when the subgraph to be avoided is a complete
bipartite graph. |
|
Newsfeed | 
Facebook | 
Twitter
