The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent

P. Erdős, P. Frankl, V. Rödl

Research output: Contribution to journalArticle

127 Citations (Scopus)

Abstract

Let H be a fixed graph of chromatic number r. It is shown that the number of graphs on n vertices and not containing H as a subgraph is {Mathematical expression}. Let hr(n) denote the maximum number of edges in an r-uniform hypergraph on n vertices and in which the union of any three edges has size greater than 3 r - 3. It is shown that hr(n) =o(n2) although for every fixed c <2 one has limn→∞hr(n)/nc = ∞.

Original languageEnglish
Pages (from-to)113-121
Number of pages9
JournalGraphs and Combinatorics
Volume2
Issue number1
DOIs
Publication statusPublished - Dec 1986

Fingerprint

Hypergraph
Subgraph
Exponent
Uniform Hypergraph
Graph in graph theory
Chromatic number
Union
Denote

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Mathematics(all)

Cite this

The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. / Erdős, P.; Frankl, P.; Rödl, V.

In: Graphs and Combinatorics, Vol. 2, No. 1, 12.1986, p. 113-121.

Research output: Contribution to journalArticle

@article{1fe690e677424f5e99fd2bea74768166,
title = "The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent",
abstract = "Let H be a fixed graph of chromatic number r. It is shown that the number of graphs on n vertices and not containing H as a subgraph is {Mathematical expression}. Let hr(n) denote the maximum number of edges in an r-uniform hypergraph on n vertices and in which the union of any three edges has size greater than 3 r - 3. It is shown that hr(n) =o(n2) although for every fixed c <2 one has limn→∞hr(n)/nc = ∞.",
author = "P. Erdős and P. Frankl and V. R{\"o}dl",
year = "1986",
month = "12",
doi = "10.1007/BF01788085",
language = "English",
volume = "2",
pages = "113--121",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "1",

}

TY - JOUR

T1 - The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent

AU - Erdős, P.

AU - Frankl, P.

AU - Rödl, V.

PY - 1986/12

Y1 - 1986/12

N2 - Let H be a fixed graph of chromatic number r. It is shown that the number of graphs on n vertices and not containing H as a subgraph is {Mathematical expression}. Let hr(n) denote the maximum number of edges in an r-uniform hypergraph on n vertices and in which the union of any three edges has size greater than 3 r - 3. It is shown that hr(n) =o(n2) although for every fixed c <2 one has limn→∞hr(n)/nc = ∞.

AB - Let H be a fixed graph of chromatic number r. It is shown that the number of graphs on n vertices and not containing H as a subgraph is {Mathematical expression}. Let hr(n) denote the maximum number of edges in an r-uniform hypergraph on n vertices and in which the union of any three edges has size greater than 3 r - 3. It is shown that hr(n) =o(n2) although for every fixed c <2 one has limn→∞hr(n)/nc = ∞.

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

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

U2 - 10.1007/BF01788085

DO - 10.1007/BF01788085

M3 - Article

VL - 2

SP - 113

EP - 121

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 1

ER -