Linear trees in uniform hypergraphs

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Given a tree T on v vertices and an integer k ≥ 2 one can define the k-expansion T (k) as a k-uniform linear hypergraph by enlarging each edge with a new, distinct set of k - 2 vertices. T (k) has v+(v-1)(k-2) vertices. The aim of this paper is to show that using the delta-system method one can easily determine asymptotically the size of the largest T (k) -free n-vertex hypergraph, i.e., the Turán number of T (k) .

Original languageEnglish
Pages (from-to)264-272
Number of pages9
JournalEuropean Journal of Combinatorics
Volume35
DOIs
Publication statusPublished - Jan 2014

Fingerprint

Uniform Hypergraph
Hypergraph
Distinct
Integer
Vertex of a graph

ASJC Scopus subject areas

  • Geometry and Topology
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Linear trees in uniform hypergraphs. / Füredi, Z.

In: European Journal of Combinatorics, Vol. 35, 01.2014, p. 264-272.

Research output: Contribution to journalArticle

@article{dca5f93c6b52441c9b5778bf7334ed08,
title = "Linear trees in uniform hypergraphs",
abstract = "Given a tree T on v vertices and an integer k ≥ 2 one can define the k-expansion T (k) as a k-uniform linear hypergraph by enlarging each edge with a new, distinct set of k - 2 vertices. T (k) has v+(v-1)(k-2) vertices. The aim of this paper is to show that using the delta-system method one can easily determine asymptotically the size of the largest T (k) -free n-vertex hypergraph, i.e., the Tur{\'a}n number of T (k) .",
author = "Z. F{\"u}redi",
year = "2014",
month = "1",
doi = "10.1016/j.ejc.2013.06.022",
language = "English",
volume = "35",
pages = "264--272",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Linear trees in uniform hypergraphs

AU - Füredi, Z.

PY - 2014/1

Y1 - 2014/1

N2 - Given a tree T on v vertices and an integer k ≥ 2 one can define the k-expansion T (k) as a k-uniform linear hypergraph by enlarging each edge with a new, distinct set of k - 2 vertices. T (k) has v+(v-1)(k-2) vertices. The aim of this paper is to show that using the delta-system method one can easily determine asymptotically the size of the largest T (k) -free n-vertex hypergraph, i.e., the Turán number of T (k) .

AB - Given a tree T on v vertices and an integer k ≥ 2 one can define the k-expansion T (k) as a k-uniform linear hypergraph by enlarging each edge with a new, distinct set of k - 2 vertices. T (k) has v+(v-1)(k-2) vertices. The aim of this paper is to show that using the delta-system method one can easily determine asymptotically the size of the largest T (k) -free n-vertex hypergraph, i.e., the Turán number of T (k) .

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

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

U2 - 10.1016/j.ejc.2013.06.022

DO - 10.1016/j.ejc.2013.06.022

M3 - Article

VL - 35

SP - 264

EP - 272

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

ER -