A contribution to the Zarankiewicz problem
| dc.creator | Nikiforov, Vladimir | |
| dc.date | 2009-03-31 | |
| dc.date.accessioned | 2026-07-07T12:58:28Z | |
| dc.date.available | 2026-07-07T12:58:28Z | |
| dc.description | Given positive integers m,n,s,t, let z(m,n,s,t) be the maximum number of ones in a (0,1) matrix of size m-by-n that does not contain an all ones submatrix of size s-by-t. We find a flexible upper bound on z(m,n,s,t) that implies the known bounds of Kovari, Sos and Turan, and of Furedi. As a consequence, we find an upper bound on the spectral radius of a graph of order n without a complete bipartite subgraph K_{s,t}. | |
| dc.identifier | https://arxiv.org/abs/0903.5350 | |
| dc.identifier | http://arxiv.org/abs/0903.5350 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/225254 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C35, 05C50 | |
| dc.title | A contribution to the Zarankiewicz problem | |
| dc.type | text |