Simple proof of the existence of restricted ramsey graphs by means of a partite construction-Reference-Cited by-同舟云学术

Simple proof of the existence of restricted ramsey graphs by means of a partite construction

Published:1981-06 Issue:2 Volume:1 Page:199-202
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

Nešetřil Jaroslav,Rödl Vojtěch

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

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

Reference11 articles.

1. W. Deuber, Generalizations of Ramsey’s theorem, in:Infinite and Finite Sets (A. Hajnal et al, eds.),Colloquia Mathematica Societatis J. Bolyai 10, North-Holland (1975), 323–332.

2. P. Erdős, A. Hajnal andL. Pósa, Strong embeddings of graphs into colored graphs, in:Infinite and finite sets (A. Hajnal et al., eds.)Coll. Math. Soc. J. Bolyai 10, North-Holland (1975), 1127–1132.

3. P. Erdős, Problems and results on finite and infinite graphs, in:Recent advances in graph theory, Academia Praha (1975), 183–192.

4. J. Folkman, Graphs with monochromatic complete subgraphs in every edge coloring,SIAM J. Appl. Math. 18 (1970), 19–29.

5. J. Nešetřil andV. Rödl, The Ramsey property for graphs with forbidden complete subgraphs,J. Comb. Theory B 20 (1976), 243–249.

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

1. On Some Generalized Vertex Folkman Numbers;Graphs and Combinatorics;2023-05-24

2. Canonical colourings in random graphs;Procedia Computer Science;2023

3. Ramsey-type numbers involving graphs and hypergraphs with large girth;Combinatorics, Probability and Computing;2021-04-12

4. All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms);Advances in Mathematics;2019-11

5. On the Nonexistence of Some Generalized Folkman Numbers;Graphs and Combinatorics;2018-08-09