The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
type: Item
instance of: scholarly article
title: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
zbMATH Open document ID: 0593.05038
DOI: 10.1007/BF01788085
author: Peter Frankl
author: Vojtěch Rödl
author: P. Erdős
published in: Graphs and Combinatorics
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 3952806
zbMATH Keywords: uniform hypergraph
MaRDI profile type: Publication
Wikidata QID: Q105583451
cites work: On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
cites work: Q3313888
cites work: On the structure of linear graphs
cites work: Q5567712
cites work: An exact result for 3-graphs
cites work: Q3693528
cites work: Lower bounds for Turán's problem
cites work: The Asymptotic Number of Lattices
cites work: K l+1 -Free Graphs: Asymptotic Structure and a 0-1 Law
cites work: On a packing and covering problem
cites work: On universality of graphs with uniformly distributed edges
cites work: On Certain Sets of Integers
cites work: Q4175585
full work available at URL: https://doi.org/10.1007/bf01788085
OpenAlex ID: W2093276208
description: scientific article; zbMATH DE number 3952806