MathematicsComputer Science

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

1986.12.1GRAPHS AND COMBINATORICS

DOI: 10.1007/bf01788085

tlooto Summary

Lethr(n) denote the maximum number of edges in anr-uniform hypergraph onn vertices and in which the union of any three edges has size greater than 3r − 3.

Abstract

Abstract is not available.

Citation format

ERDÖS, P.; FRANKL, P.; RÖDL, V. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. GRAPHS AND COMBINATORICS, 1986, 2: 113–121.