Saturated r-uniform hypergraphs

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

The following dual version of Turán's problem is considered: for a given r-uniform hypergraph F, determine the minimum number of edges in an r-uniform hypergraph H on n vertices, such that F ⊄ H but a subhypergraph isomorphic to F occurs whenever a new edge (r-tuple) is added to H. For some types of F we find the exact value of the minimum or describe its asymptotic behavior as n tends to infinity; namely; for Hr(r + 1, r), Hr(2r -2, 2) and Hr(r + 1, 3), where Hr(p, q) denotes the family of all r-uniform hypergraphs with p vertices and q edges. Several problems remain open.

Original languageEnglish
Pages (from-to)95-104
Number of pages10
JournalDiscrete Mathematics
Volume98
Issue number2
DOIs
Publication statusPublished - Dec 25 1991

Fingerprint

Uniform Hypergraph
Open Problems
Isomorphic
Asymptotic Behavior
Infinity
Tend
Denote

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Saturated r-uniform hypergraphs. / Erdős, P.; Füredi, Z.; Tuza, Z.

In: Discrete Mathematics, Vol. 98, No. 2, 25.12.1991, p. 95-104.

Research output: Contribution to journalArticle

@article{0d1388bde77a45e98b8b789649fffd38,
title = "Saturated r-uniform hypergraphs",
abstract = "The following dual version of Tur{\'a}n's problem is considered: for a given r-uniform hypergraph F, determine the minimum number of edges in an r-uniform hypergraph H on n vertices, such that F ⊄ H but a subhypergraph isomorphic to F occurs whenever a new edge (r-tuple) is added to H. For some types of F we find the exact value of the minimum or describe its asymptotic behavior as n tends to infinity; namely; for Hr(r + 1, r), Hr(2r -2, 2) and Hr(r + 1, 3), where Hr(p, q) denotes the family of all r-uniform hypergraphs with p vertices and q edges. Several problems remain open.",
author = "P. Erdős and Z. F{\"u}redi and Z. Tuza",
year = "1991",
month = "12",
day = "25",
doi = "10.1016/0012-365X(91)90035-Z",
language = "English",
volume = "98",
pages = "95--104",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Saturated r-uniform hypergraphs

AU - Erdős, P.

AU - Füredi, Z.

AU - Tuza, Z.

PY - 1991/12/25

Y1 - 1991/12/25

N2 - The following dual version of Turán's problem is considered: for a given r-uniform hypergraph F, determine the minimum number of edges in an r-uniform hypergraph H on n vertices, such that F ⊄ H but a subhypergraph isomorphic to F occurs whenever a new edge (r-tuple) is added to H. For some types of F we find the exact value of the minimum or describe its asymptotic behavior as n tends to infinity; namely; for Hr(r + 1, r), Hr(2r -2, 2) and Hr(r + 1, 3), where Hr(p, q) denotes the family of all r-uniform hypergraphs with p vertices and q edges. Several problems remain open.

AB - The following dual version of Turán's problem is considered: for a given r-uniform hypergraph F, determine the minimum number of edges in an r-uniform hypergraph H on n vertices, such that F ⊄ H but a subhypergraph isomorphic to F occurs whenever a new edge (r-tuple) is added to H. For some types of F we find the exact value of the minimum or describe its asymptotic behavior as n tends to infinity; namely; for Hr(r + 1, r), Hr(2r -2, 2) and Hr(r + 1, 3), where Hr(p, q) denotes the family of all r-uniform hypergraphs with p vertices and q edges. Several problems remain open.

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

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

U2 - 10.1016/0012-365X(91)90035-Z

DO - 10.1016/0012-365X(91)90035-Z

M3 - Article

AN - SCOPUS:0348096226

VL - 98

SP - 95

EP - 104

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 2

ER -