Complete r-partite subgraphs of dense r-graphs
| dc.creator | Nikiforov, Vladimir | |
| dc.date | 2007-11-07 | |
| dc.date.accessioned | 2026-07-07T08:41:31Z | |
| dc.date.available | 2026-07-07T08:41:31Z | |
| dc.description | We determine how large r-partite graphs can be found in r-uniform graphs with n vertices and Cn^r edges, where C is a slowly decreasing function of n. This refines results of Erdos from 1964. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/0711.1185 | |
| dc.identifier | http://arxiv.org/abs/0711.1185 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/141698 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C65 | |
| dc.title | Complete r-partite subgraphs of dense r-graphs | |
| dc.type | text |