Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs
| dc.creator | Pikhurko, Oleg | |
| dc.date | 2005-10-11 | |
| dc.date.accessioned | 2026-07-07T06:47:22Z | |
| dc.date.available | 2026-07-07T06:47:22Z | |
| dc.description | Let l>k>2. Let the k-graph H^k_l be obtained from the complete 2-graph K_l^2 by enlarging each edge with a new set of k-2 vertices. Mubayi ["A hypergraph extension of Turan's theorem", to appear in J. Combin. Th. (B)] computed asymptotically the Turan function ex(n,H_l^k). Here we determine the exact value of ex(n,H_l^k) for all sufficiently large n, settling a conjecture of Mubayi. | |
| dc.description | Accepted by JCTB; publication suspended because of a disagreement over the copyright, see http://www.math.cmu.edu/~pikhurko/Copyright.html | |
| dc.identifier | https://arxiv.org/abs/math/0510227 | |
| dc.identifier | http://arxiv.org/abs/math/0510227 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/103630 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C35 | |
| dc.title | Exact Computation of the Hypergraph Turan Function for Expanded Complete 2-Graphs | |
| dc.type | text |