A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Vertex Ramsey Properties of Families of Graphs

2002
*
Journal of combinatorial theory. Series B (Print)
*

ACKNOWLEDGMENTS We thank Olivier Riordan for suggesting the proof

doi:10.1006/jctb.2001.2078
fatcat:3dji2chtk5dvjngnpnxlfeluji
*of*Theorem 1* and Vojtěch Rödl for his insightful remarks and comments.*VERTEX**RAMSEY**PROPERTIES*... Thus, every finite*family**of**graphs*G 1 , ..., G r can be associated with a (*vertex*)*Ramsey**property*. ... L FINAL REMARKS The most interesting open question concerning*vertex**Ramsey**properties**of**families**of**graphs*is whether for every two*families*G and H*of*connected nontrivial*graphs*the condition (G) ...##
###
Small minimal (3, 3)-Ramsey graphs
[article]

2016
*
arXiv
*
pre-print

We say that G is a (3, 3)-

arXiv:1604.03716v1
fatcat:j4v5x4mb6nev7gykuoswpj5xwe
*Ramsey**graph*if every 2-coloring*of*the edges*of*G forces a monochromatic triangle. ... In this work we find all minimal (3, 3)-*Ramsey**graphs*with up to 13 vertices with the help*of*a computer, and we obtain some new results for these*graphs*. ... Nedyalko Nenov, who read the manuscript and made some suggestions which led to the improvement*of*this work. ...##
###
Minimal vertex Ramsey graphs and minimal forbidden subgraphs

2004
*
Discrete Mathematics
*

A

doi:10.1016/j.disc.2003.11.042
fatcat:ewtmvbyyubhnllr7loayugptfe
*graph*G is called (H ) k -*vertex**Ramsey*minimal if G v → (H ) k , but G v 9 (H ) k for any proper subgraph G*of*G. The class*of*(P3) k -*vertex**Ramsey*minimal*graphs*is investigated. ... Let P be a*property**of**graphs*. ... Acknowledgements The authors are very grateful to the referees for their help in preparing the ÿnal version*of*the paper. ...##
###
Page 775 of Mathematical Reviews Vol. , Issue 2001B
[page]

2001
*
Mathematical Reviews
*

New

*families**of*intersection*graphs**of*filaments are defined using*families**of*circular arcs*of*a circle and*families**of*subtrees*of*a tree or*of*a cactus.” ... Summary: “We describe a method*of*defining new*families**of**graphs*called G-mixed, using the method*of*partitioning the edge set*of*overlap*graphs*. Consider a hereditary*family*G*of**graphs*. ...##
###
On Pattern Ramsey Numbers of Graphs

2004
*
Graphs and Combinatorics
*

colored complete

doi:10.1007/s00373-004-0562-y
fatcat:kwozlhqgrffe5l5cvaralz6you
*graph*K lex p is a*Ramsey**family*. ... The second version*of*the Canonical*Ramsey*Theorem above says that the three-pattern*family*consisting*of*a monochromatic complete*graph*K mono p , a polychromatic complete*graph*K poly p , and a lexically ...##
###
Constrained Ramsey numbers of graphs

2002
*
Journal of Graph Theory
*

colored complete

doi:10.1002/jgt.10072
fatcat:iuikbucfjbavxfkn52ehvkd46e
*graph*K lex p is a*Ramsey**family*. ... The second version*of*the Canonical*Ramsey*Theorem above says that the three-pattern*family*consisting*of*a monochromatic complete*graph*K mono p , a polychromatic complete*graph*K poly p , and a lexically ...##
###
Vertex Ramsey properties of randomly perturbed graphs

2020
*
Random structures & algorithms (Print)
*

us information on the

doi:10.1002/rsa.20971
fatcat:uaqqqfe6gbfpnaq3mo5vl3tjmq
*vertex**Ramsey**properties**of*typical*graphs**of*a given density. ... Moreover, we will need to appeal to the*Ramsey**properties**of*the random*graph*over various*vertex*subsets. ... the bounds, it would help to better understand the k-covers*of*a*graph*F, and to see if there are different colorings*of*G n ∪ G(n, p) that show (4.3) is not tight. ...##
###
Colour classes for $r$-graphs

1972
*
Canadian mathematical bulletin
*

The author gratefully acknowledges the support

doi:10.4153/cmb-1972-063-2
fatcat:b55n2b3zvrb7tjqpthbyko6aiu
*of*the Canadian National Research Council in the form*of*research Grant A7544. ... Let G be an r-*graph*, P be a hereditary*property*(see [8, p. 96] ) and for v e V(G) let SP P (v) be a*family**of*subgraphs*of*G with the following*properties*: (SL)HG^P(V)^>VEV(H). ...*of*any*vertex*from Wi restores the*property*P. ...##
###
Recent developments in graph Ramsey theory
[article]

2015
*
arXiv
*
pre-print

Given a

arXiv:1501.02474v3
fatcat:q3qcowfhgjbp5j36oetad6qdnq
*graph*H, the*Ramsey*number r(H) is the smallest natural number N such that any two-colouring*of*the edges*of*K_N contains a monochromatic copy*of*H. ... Even so, there has been a great deal*of*recent progress on the study*of**Ramsey*numbers and their variants, spurred on by the many advances across extremal combinatorics. ... The authors would like to thank the anonymous referee for a number*of*useful comments. ...##
###
Page 6546 of Mathematical Reviews Vol. , Issue 93m
[page]

1993
*
Mathematical Reviews
*

Forb(G) is the

*family**of**graphs*H such that there is no embedding from G into H. A*family*¥*of**graphs*is*Ramsey*if for all*graphs*B € ¥ there is a*graph*A €.F such that A -—(B)!. ... indi- cates that H is*vertex**Ramsey*to G, that is, any*vertex*coloring*of*H with r colors admits a monochromatic induced copy*of*G. ...##
###
Chromatic Number is Ramsey Distinguishing
[article]

2019
*
arXiv
*
pre-print

A

arXiv:1909.02590v1
fatcat:gpzfz3b3dvcftb67mukk4tfi7u
*graph*G is*Ramsey*for a*graph*H if every colouring*of*the edges*of*G in two colours contains a monochromatic copy*of*H. ... Two*graphs*H_1 and H_2 are*Ramsey*equivalent if any*graph*G is*Ramsey*for H_1 if and only if it is*Ramsey*for H_2. ... Acknowledgements The author would like to thank the University*of*Cambridge Faculty*of*Mathematics Summer Research Scheme and the Lister Fund*of*Queens' College, Cambridge for funding this work, Julia ...##
###
Page 2131 of Mathematical Reviews Vol. , Issue 80F
[page]

1980
*
Mathematical Reviews
*

In this paper, the authors show that the

*Ramsey**property*holds simultaneously for arbitrary collections*of**Ramsey**families*under quite general conditions. ... A*family*¥*of*finite subsets*of*a set U is said to be*Ramsey*if when U is partitioned into finitely many parts, there is a part which contains an F €§ as a subset. ...##
###
Page 8089 of Mathematical Reviews Vol. , Issue 2003k
[page]

2003
*
Mathematical Reviews
*

*of*

*families*

*of*

*graphs*. ... Gabriel Semanisin (SK-SFRKS-GA; KoSice) 2003k:05084 05C55 Luczak, Tomasz (PL-POZNM-DM; Poznan); Rucinski, Andrzej (PL-POZNM-DM; Poznan) ; Urbanski, Sebastian (PL-POZNM-DM; Poznan)

*Vertex*

*Ramsey*

*properties*...

##
###
Page 1300 of Mathematical Reviews Vol. , Issue 91C
[page]

1991
*
Mathematical Reviews
*

The equivalence

*of*the “*Ramsey**property*” and the apparently weaker “pair-*Ramsey**property*” is also shown. Ralph Faudree (1-MEMP) ... For many*families**of**graphs*, the problem*of*finding all*graphs*whose largest eigenvalue is either minimal or maximal has been solved. ...##
###
The Ramsey property for families of graphs which exclude a given graph

1992
*
Canadian Journal of Mathematics - Journal Canadien de Mathematiques
*

A class

doi:10.4153/cjm-1992-064-7
fatcat:vzky7za7bngnbd2gxdr2ddeyl4
*of**graphs*J has the*Ramsey**property*if, for every B ... For*graphs*A, B and a positive integer r, the relation A -• (B) l r means that whenever A is an r-colouring*of*the vertices*of*A, then there is an embedding*of*B into A such that A o is constant. ... A class*of**graphs*J has the*Ramsey**property*if, for every B G ^F, there is an A G IT such that A -> (#)£. ...
« Previous

*Showing results 1 — 15 out of 2,582 results*