Codegree Turán density of complete $r$-uniform hypergraphs

Allan Lo; Yi Zhao

doi:10.1137/18M1163956

Codegree Turán density of complete $r$-uniform hypergraphs

Allan Lo, Yi Zhao

Mathematics

Research output: Contribution to journal › Article › peer-review

217 Downloads (Pure)

Original language	English
Pages (from-to)	1154-1158
Journal	SIAM Journal on Discrete Mathematics
Volume	32
Issue number	2
Early online date	31 May 2018
DOIs	https://doi.org/10.1137/18M1163956
Publication status	Published - 2018

Keywords

Turan
minimum codegree
Hypergraph

Access to Document

10.1137/18M1163956

codegKt_submitted_revised
Checked for eligibility: 20/04/2018 First Published in SIAM Journal on Discrete Mathematics in Vol 32, 2018, published by the Society for Industrial and Applied Mathematics (SIAM) Version of record available at: https://doi.org/10.1137/18M1163956
Accepted author manuscript, 269 KB

A graph theoretical approach for combinatorial designs
Lo, A. (Principal Investigator)
Engineering & Physical Science Research Council
1/11/16 → 31/10/18
Project: Research Councils

Cite this

@article{352b2e8921414b51bcaa86d700aeeda6,

title = "Codegree Tur{\'a}n density of complete $r$-uniform hypergraphs",

keywords = "Turan, minimum codegree, Hypergraph",

author = "Allan Lo and Yi Zhao",

year = "2018",

doi = "10.1137/18M1163956",

language = "English",

volume = "32",

pages = "1154--1158",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

T1 - Codegree Turán density of complete $r$-uniform hypergraphs

AU - Lo, Allan

AU - Zhao, Yi

PY - 2018

Y1 - 2018

KW - Turan

KW - minimum codegree

KW - Hypergraph

U2 - 10.1137/18M1163956

DO - 10.1137/18M1163956

M3 - Article

SN - 0895-4801

VL - 32

SP - 1154

EP - 1158

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 2

ER -

Codegree Turán density of complete $r$-uniform hypergraphs

Keywords

Access to Document

Projects

A graph theoretical approach for combinatorial designs

Cite this