umu.sePublications
Change search

Cite
Citation style
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf
l-Degree Turan Density
Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
2014 (English)In: SIAM Journal on Discrete Mathematics, ISSN 0895-4801, E-ISSN 1095-7146, Vol. 28, no 3, p. 1214-1225Article in journal (Refereed) Published
Abstract [en]

Let H-n be a k-graph on n vertices. For 0 <= l < k and an l-subset T of V (H-n), define the degree deg(T) of T to be the number of (k - l)-subsets S such that S boolean OR T is an edge in H-n. Let the minimum l-degree of H-n be delta(l) (H-n) = min{deg(T) : T subset of V (H-n) and vertical bar T vertical bar = l}. Given a family F of k-graphs, the l-degree Turan number ex(l) (n, F) is the largest delta(l) (H-n) over all F-free k-graphs H-n on n vertices. Hence, ex(0) (n, F) is the Turan number. We define l-degree Turan density to be pi(kappa)(l) (F) = lim sup(n ->infinity) ex(l)(n, F)/kappa(n-l). In this paper, we show that for k > l > 1, the set of pi(kappa)(l) (F) is dense in the interval [0, 1). Hence, there is no "jump" for l-degree Turan density when k > l > 1. We also give a lower bound on pi(kappa)(l) (F) in terms of an ordinary Turan density.

Place, publisher, year, edition, pages
2014. Vol. 28, no 3, p. 1214-1225
National Category
Discrete Mathematics
Identifiers
ISI: 000343230800012OAI: oai:DiVA.org:umu-92706DiVA, id: diva2:742346
Available from: 2014-09-01 Created: 2014-09-01 Last updated: 2018-06-07Bibliographically approved

Open Access in DiVA

File information
File name FULLTEXT01.pdfFile size 262 kBChecksum SHA-512
ffc7fc9d0966f53969d03e1693d0c5d2b1624368388a604f3433f381a63c4e5c292d1d20f28e0928df3221f9c27f6c3b171bf244f704e5693837ece53f3df9fe
Type fulltextMimetype application/pdf

Publisher's full text

Markström, Klas

Search in DiVA

Markström, Klas
By organisation
Department of Mathematics and Mathematical Statistics
In the same journal
SIAM Journal on Discrete Mathematics
On the subject
Discrete Mathematics

Search outside of DiVA

The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available
doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 131 hits

Cite
Citation style
• apa
• ieee
• modern-language-association-8th-edition
• vancouver
• Other style
More styles
Language
• de-DE
• en-GB
• en-US
• fi-FI
• nn-NO
• nn-NB
• sv-SE
• Other locale
More languages
Output format
• html
• text
• asciidoc
• rtf