Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(2)
Edge Coloring
ramsey number
Related Publications
(1)
Properly colored subgraphs and rainbow subgraphs in edgecolorings with local constraints
Subscribe
Academic
Publications
On Pattern Ramsey Numbers of Graphs
On Pattern Ramsey Numbers of Graphs,10.1007/s003730040562y,Graphs and Combinatorics,Robert E. Jamison,Douglas B. West
Edit
On Pattern Ramsey Numbers of Graphs
(
Citations: 12
)
BibTex

RIS

RefWorks
Download
Robert E. Jamison
,
Douglas B. West
A color pattern is a graph whose edges are partitioned into color classes. A family F of color patterns is a Ramsey family if there is some integer N such that every edge coloring of KN has a copy of some pattern in F. The smallest such N is the (pattern)
Ramsey number
R(F ) of F. The classical Canonical Ramsey Theorem of Erd} os and Rado (4) yields an easy characterization of the Ramsey families of color patterns. In this paper we determine R(F ) for all families consisting of equipartitioned stars, and we prove that 5bs 1
Journal:
Graphs and Combinatorics
, vol. 20, no. 3, pp. 333339, 2004
DOI:
10.1007/s003730040562y
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.math.uiuc.edu
)
(
www.informatik.unitrier.de
)
(
dx.doi.org
)
More »
Citation Context
(7)
...As shown by Jamison and West [
14
], an (H;G)good coloring of an arbitrarily large complete graph exists unless either G is a star or H is a forest...
MARIA AXENOVICH
,
et al.
ON COLORINGS AVOIDING A RAINBOW CYCLE AND A FIXED MONOCHROMATIC SUBGRA...
...Concerning the more general problem of considering general patterns of colors, Jamison and West [
74
] considered a particular family of colorings (equipartitioned stars) while Axenovich and Jamison [15] studied another family (F = {K lex n , K rain , H mono }). Notice this is related to the rainbow triangle free work dis...
Shinya Fujita
,
et al.
Rainbow Generalizations of Ramsey Theory: A Survey
... a combination of the two problems, Axenovich and Iverson [1] defined the mixed Ramsey numbers maxR(n, G, H) and minR(n, G, H) as the maximum (respectively, minimum) number of colours in an edgecolouring of Kn such that no monochromatic subgraph of Kn is isomorphic to G and no rainbow subgraph is isomorphic to H. They noted that the numbers are welldefined whenever the edges of G do not induce a star and H is not a forest (see also [
9
])...
Veselin Jungic
,
et al.
A note on edgecolourings avoiding rainbow K_4 and monochromatic K_m
...The constrained Ramsey number has been studied by many researchers [1, 3, 4, 7, 8, 10, 13,
14
, 18], and the bipartite case in [2]...
Poshen Loh
,
et al.
Constrained Ramsey Numbers
...On the other hand, the problem of nding unavoidable rainbow H or monochromatic G in any coloring of Kn for n large enough, has been studied in [
18
], when H is a forest and G is a star...
...This is an easy observation which can also be found in [
18
]...
Maria Axenovich
,
et al.
Edgecolorings avoiding rainbow and monochromatic subgraphs
References
(7)
Properly colored subgraphs and rainbow subgraphs in edgecolorings with local constraints
(
Citations: 17
)
Noga Alon
,
Tao Jiang
,
Zevi Miller
,
Dan Pritikin
Journal:
Random Structures and Algorithms  RSA
, vol. 23, no. 4, pp. 409433, 2003
Constrained Ramsey numbers of graphs
(
Citations: 16
)
Robert E. Jamison
,
Tao Jiang
,
Alan C. H. Ling
Journal:
Journal of Graph Theory  JGT
, vol. 42, no. 1, pp. 116, 2003
On Canonical Ramsey Numbers for Complete Graphs versus Paths
(
Citations: 13
)
Hanno Lefmann
,
Vojtech Rödl
Journal:
Journal of Combinatorial Theory  JCT
, vol. 58, no. 1, pp. 113, 1993
New Upper Bounds for a Canonical Ramsey Problem
(
Citations: 8
)
Tao Jiang
,
Dhruv Mubayi
Journal:
Combinatorica
, vol. 20, no. 1, pp. 141146, 2000
Local kcolorings of graphs and hypergraphs
(
Citations: 16
)
András Gyárfás
,
Jenö Lehel
,
Jaroslav Nesetril
,
Vojtech Rödl
,
Richard H. Schelp
,
Zsolt Tuza
Journal:
Journal of Combinatorial Theory  JCT
, vol. 43, no. 2, pp. 127139, 1987
Sort by:
Citations
(12)
Orientable edge colorings of graphs
(
Citations: 1
)
Robert E. Jamison
Journal:
Discrete Applied Mathematics  DAM
, vol. 159, no. 7, pp. 595604, 2011
ON COLORINGS AVOIDING A RAINBOW CYCLE AND A FIXED MONOCHROMATIC SUBGRAPH
(
Citations: 2
)
MARIA AXENOVICH
,
JIHYEOK CHOI
Published in 2010.
Rainbow Generalizations of Ramsey Theory: A Survey
(
Citations: 2
)
Shinya Fujita
,
Colton Magnant
,
Kenta Ozeki
Journal:
Graphs and Combinatorics
, vol. 26, no. 1, pp. 130, 2010
DNAshell, dispositif innovant de stockage de l’ADN
JeanMarie Manus
Journal:
Revue Francophone Des Laboratoires
, vol. 2010, no. 427, pp. 1111, 2010
A note on monotonicity of mixed Ramsey numbers
Maria Axenovich
,
JiHyeok Choi
Published in 2010.