Large triangle-free subgraphs in graphs withoutK 4-Reference-Cited by-同舟云学术

Large triangle-free subgraphs in graphs withoutK 4

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

Author:

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/BF01788087.pdf

Reference14 articles.

1. Alon, N.: Personal communication

2. Bollobás, B.: Extermal Graph Theory. London-New York-San Francisco: Academic Press 1978

3. Chernoff, H.: A measure of asymptotic efficiency for tests of hypothesis based on the sum of observations. Ann. Stat.23, 493–502 (1952)

4. Erdös, P.: Problems and results on finite and infinite graphs. In: Recent Advances in Graph Theory (Proceedings of the Symposium held in Prague 1974) edited by M. Fiedler, pp 183–192. Praha: Academia 1974

5. Erdös, P.: On some of my conjectures in number theory and combinatorics. Congr. Numerantium39, 3–19 (1983)

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

1. Edge-Colored Graphs: Ramsey and Folkman Numbers;The New Mathematical Coloring Book;2024

2. Turán‐type problems for long cycles in random and pseudo‐random graphs;Journal of the London Mathematical Society;2023-02-26

3. A canonical Ramsey theorem with list constraints in random graphs;Procedia Computer Science;2023

4. LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS;Bulletin of the Australian Mathematical Society;2022-12-02

5. Ramsey goodness of trees in random graphs;Random Structures & Algorithms;2022-11-09