The Library
Exact computation of the hypergraph Turán function for expanded complete 2-graphs
Tools
Tools
Tools
Pikhurko, Oleg (2013) Exact computation of the hypergraph Turán function for expanded complete 2-graphs. Journal of Combinatorial Theory, Series B, Volume 103 (Number 2). pp. 220-225. doi:10.1016/j.jctb.2012.09.005
Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1016/j.jctb.2012.09.005
Abstract
Let l>k⩾3. Let the k-graph be obtained from the complete 2-graph by enlarging each edge with a new set of k−2 vertices. Mubayi [A hypergraph extension of Turánʼs theorem, J. Combin. Theory Ser. B 96 (2006) 122–134] computed asymptotically the Turán function . Here we determine the exact value of for all sufficiently large n, settling a conjecture of Mubayi.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Divisions: | Faculty of Science > Mathematics | ||||
| Journal or Publication Title: | Journal of Combinatorial Theory, Series B | ||||
| Publisher: | Academic Press | ||||
| ISSN: | 0095-8956 | ||||
| Official Date: | March 2013 | ||||
| Dates: |
|
||||
| Volume: | Volume 103 | ||||
| Number: | Number 2 | ||||
| Page Range: | pp. 220-225 | ||||
| DOI: | 10.1016/j.jctb.2012.09.005 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
