The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- 1 December 1986
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 2 (1) , 113-121
- https://doi.org/10.1007/bf01788085
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- An exact result for 3-graphsPublished by Elsevier ,2003
- On universality of graphs with uniformly distributed edgesDiscrete Mathematics, 1986
- Lower bounds for Turán's problemGraphs and Combinatorics, 1985
- On a Packing and Covering ProblemEuropean Journal of Combinatorics, 1985
- The Asymptotic Number of LatticesPublished by Elsevier ,1980
- Problems and results in combinatorial analysisProceedings of Symposia in Pure Mathematics, 1971
- On Certain Sets of IntegersJournal of the London Mathematical Society, 1953
- On Sets of Integers Which Contain No Three Terms in Arithmetical ProgressionProceedings of the National Academy of Sciences, 1946
- On the structure of linear graphsBulletin of the American Mathematical Society, 1946