Turán's theorem for k-graphs

Joel Spencer

doi:10.1016/0012-365X(72)90084-2

Turán's theorem for k-graphs

Joel Spencer

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

Abstract

Let T(n, k, b) (T for Turán) denote the smallest q such that there exists a k-graph with n vertices, q edges, and no independent set of size b. Improved lower bounds are found for the function T.

Original language	English (US)
Pages (from-to)	183-186
Number of pages	4
Journal	Discrete Mathematics
Volume	2
Issue number	2
DOIs	https://doi.org/10.1016/0012-365X(72)90084-2
State	Published - May 1972

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(72)90084-2

Cite this

@article{acd8d77b754848e593599011057bae24,

title = "Tur{\'a}n's theorem for k-graphs",

abstract = "Let T(n, k, b) (T for Tur{\'a}n) denote the smallest q such that there exists a k-graph with n vertices, q edges, and no independent set of size b. Improved lower bounds are found for the function T.",

author = "Joel Spencer",

year = "1972",

month = may,

doi = "10.1016/0012-365X(72)90084-2",

language = "English (US)",

volume = "2",

pages = "183--186",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - Turán's theorem for k-graphs

AU - Spencer, Joel

PY - 1972/5

Y1 - 1972/5

N2 - Let T(n, k, b) (T for Turán) denote the smallest q such that there exists a k-graph with n vertices, q edges, and no independent set of size b. Improved lower bounds are found for the function T.

AB - Let T(n, k, b) (T for Turán) denote the smallest q such that there exists a k-graph with n vertices, q edges, and no independent set of size b. Improved lower bounds are found for the function T.

UR - http://www.scopus.com/inward/record.url?scp=0011610141&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0011610141&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(72)90084-2

DO - 10.1016/0012-365X(72)90084-2

M3 - Article

AN - SCOPUS:0011610141

SN - 0012-365X

VL - 2

SP - 183

EP - 186

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 2

ER -

Turán's theorem for k-graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this