The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent-Reference-Cited by-同舟云学术

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

Published:1986-12 Issue:1 Volume:2 Page:113-121
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

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

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01788085.pdf

Reference23 articles.

1. Alon, N.: Personal communication 1985

2. Behrend, F.A.: On sets of integers which contain no three elements in arithmetic progression Proc, Nat. Acad. Sci.,23, 331–332 (1946)

3. Brown, W.G., P. Erdös, V.T. Sós: Some extremal problems onr-graphs. In: Proc. Third Ann. Arbor Conf. on Graph Th., pp. 53–63. New York: Academic Press 1973

4. de Caen, D.: Extension of a theorem of Moon and Moser on complete subgraphs. Ars Comb.16, 5–10 (1983)

5. de Caen, D.: On Turán's hypergraph problem. Ph.D. Thesis, University of Toronto 1982

Cited by 181 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Generalized Turán results for intersecting cliques;Discrete Mathematics;2024-01

2. Improved Lower Bounds for Multiplicative Square-Free Sequences;The Electronic Journal of Combinatorics;2023-12-01

3. Almost Every Matroid has an $M(K_4)$- or a $\mathcal{W}^3$-Minor;The Electronic Journal of Combinatorics;2023-11-17

4. Degenerate Turán Densities of Sparse Hypergraphs II: A Solution to the Brown-Erdős-Sós Problem for Every Uniformity;SIAM Journal on Discrete Mathematics;2023-08-24

5. On sufficient conditions for spanning structures in dense graphs;Proceedings of the London Mathematical Society;2023-07-21