Zarankiewicz Problem
CHF 42.90
Auf Lager
SKU
5RM0HC0VOR6
1 Verfügbar
Geliefert zwischen Di., 23.09.2025 und Mi., 24.09.2025
Details
High Quality Content by WIKIPEDIA articles! 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.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786131177392
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Genre Mathematik
- EAN 9786131177392
- Format Fachbuch
- Titel Zarankiewicz Problem
- Herausgeber Betascript Publishing
- Anzahl Seiten 96
Bewertungen
Schreiben Sie eine Bewertung
