To see the other types of publications on this topic, follow the link: Rainbow Ramsety Number.

Journal articles on the topic 'Rainbow Ramsety Number'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 37 journal articles for your research on the topic 'Rainbow Ramsety Number.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Ramireddy, B., Mohan Chand, Sri Krishna Chaitanya, and B. R. Srinivas. "APPLICATIONS OF EDGE COLORING OF GRAPHS WITH RAINBOW NUMBERS PHENOMENA." International Journal of Research -GRANTHAALAYAH 3, no. 12 (2015): 163–70. http://dx.doi.org/10.29121/granthaalayah.v3.i12.2015.2901.

Full text
Abstract:
This paper studies the Rainbow Ramsety Number for a non empty graph and the main results are 1. The Rainbow Ramsety Number of a graph F with out isolated vertices is defined if and only if F is a forest. 2. The Rainbow Ramsety Number of two graphs F1 and F2 with out isolated vertices is defined if and only if F1 is a star or F2 is a forest.
APA, Harvard, Vancouver, ISO, and other styles
2

Dr., B. Ramireddy, Mohan Chand U., Sri Krishna Chaitanya A., and Sri Krishna Chaitanya A. "APPLICATIONS OF EDGE COLORING OF GRAPHS WITH RAINBOW NUMBERS PHENOMENA." International Journal of Research – Granthaalayah 3, no. 12 (2017): 163–70. https://doi.org/10.5281/zenodo.848967.

Full text
Abstract:
This paper studies the Rainbow Ramsety Number for a non empty graph and the main results are 1. The Rainbow Ramsety Number of a graph F with out isolated vertices is defined if and only if F is a forest. 2. The Rainbow Ramsety Number of two graphs F1 and F2 with out isolated vertices is defined if and only if F1 is a star or F2 is a forest..
APA, Harvard, Vancouver, ISO, and other styles
3

Eroh, Linda, and Ortrud R. Oellermann. "Bipartite rainbow Ramsey numbers." Discrete Mathematics 277, no. 1-3 (2004): 57–72. http://dx.doi.org/10.1016/s0012-365x(03)00154-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Axenovich, Maria, Tao Jiang, and Z. Tuza. "Local Anti-Ramsey Numbers of Graphs." Combinatorics, Probability and Computing 12, no. 5-6 (2003): 495–511. http://dx.doi.org/10.1017/s0963548303005868.

Full text
Abstract:
A subgraph H in an edge-colouring is properly coloured if incident edges of H are assigned different colours, and H is rainbow if no two edges of H are assigned the same colour. We study properly coloured subgraphs and rainbow subgraphs forced in edge-colourings of complete graphs in which each vertex is incident to a large number of colours.
APA, Harvard, Vancouver, ISO, and other styles
5

LOH, PO-SHEN, and BENNY SUDAKOV. "Constrained Ramsey Numbers." Combinatorics, Probability and Computing 18, no. 1-2 (2009): 247–58. http://dx.doi.org/10.1017/s0963548307008875.

Full text
Abstract:
For two graphs S and T, the constrained Ramsey number f(S, T) is the minimum n such that every edge colouring of the complete graph on n vertices (with any number of colours) has a monochromatic subgraph isomorphic to S or a rainbow subgraph isomorphic to T. Here, a subgraph is said to be rainbow if all of its edges have different colours. It is an immediate consequence of the Erdős–Rado Canonical Ramsey Theorem that f(S, T) exists if and only if S is a star or T is acyclic. Much work has been done to determine the rate of growth of f(S, T) for various types of parameters. When S and T are bot
APA, Harvard, Vancouver, ISO, and other styles
6

Gorgol, Izolda. "Avoiding rainbow 2-connected subgraphs." Open Mathematics 15, no. 1 (2017): 393–97. http://dx.doi.org/10.1515/math-2017-0035.

Full text
Abstract:
Abstract While defining the anti-Ramsey number Erdős, Simonovits and Sós mentioned that the extremal colorings may not be unique. In the paper we discuss the uniqueness of the colorings, generalize the idea of their construction and show how to use it to construct the colorings of the edges of complete split graphs avoiding rainbow 2-connected subgraphs. These colorings give the lower bounds for adequate anti-Ramsey numbers.
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Ye, and Yusheng Li. "Bounds for Bipartite Rainbow Ramsey Numbers." Graphs and Combinatorics 33, no. 4 (2017): 1065–79. http://dx.doi.org/10.1007/s00373-017-1794-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Xihe, Pierre Besse, Colton Magnant, Ligong Wang, and Noah Watts. "Gallai–Ramsey Numbers for Rainbow Paths." Graphs and Combinatorics 36, no. 4 (2020): 1163–75. http://dx.doi.org/10.1007/s00373-020-02175-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lo, Allan Siu Lun. "Constrained Ramsey numbers for rainbow matching." Journal of Graph Theory 67, no. 2 (2010): 91–95. http://dx.doi.org/10.1002/jgt.20517.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Xiang, Changyuan, Yongxin Lan, Qinghua Yan, and Changqing Xu. "The Outer-Planar Anti-Ramsey Number of Matchings." Symmetry 14, no. 6 (2022): 1252. http://dx.doi.org/10.3390/sym14061252.

Full text
Abstract:
A subgraph H of an edge-colored graph G is called rainbow if all of its edges have different colors. Let ar(G,H) denote the maximum positive integer t, such that there is a t-edge-colored graph G without any rainbow subgraph H. We denote by kK2 a matching of size k and On the class of all maximal outer-planar graphs on n vertices, respectively. The outer-planar anti-Ramsey number of graph H, denoted by ar(On,H), is defined as max{ar(On,H)|On∈On}. It seems nontrivial to determine the exact values for ar(On,H) because most maximal outer-planar graphs are asymmetry. In this paper, we obtain that
APA, Harvard, Vancouver, ISO, and other styles
11

Ding, Jili, Hong Bian, and Haizheng Yu. "Anti-Ramsey Numbers in Complete k-Partite Graphs." Mathematical Problems in Engineering 2020 (September 7, 2020): 1–5. http://dx.doi.org/10.1155/2020/5136104.

Full text
Abstract:
The anti-Ramsey number ARG,H is the maximum number of colors in an edge-coloring of G such that G contains no rainbow subgraphs isomorphic to H. In this paper, we discuss the anti-Ramsey numbers ARKp1,p2,…,pk,Tn, ARKp1,p2,…,pk,ℳ, and ARKp1,p2,…,pk,C of Kp1,p2,…,pk, where Tn,ℳ, and C denote the family of all spanning trees, the family of all perfect matchings, and the family of all Hamilton cycles in Kp1,p2,…,pk, respectively.
APA, Harvard, Vancouver, ISO, and other styles
12

Jin, Zemin, Oothan Nweit, Kaijun Wang, and Yuling Wang. "Anti-Ramsey numbers for matchings in regular bipartite graphs." Discrete Mathematics, Algorithms and Applications 09, no. 02 (2017): 1750019. http://dx.doi.org/10.1142/s1793830917500197.

Full text
Abstract:
Let [Formula: see text] be a family of graphs. The anti-Ramsey number [Formula: see text] for [Formula: see text] in the graph [Formula: see text] is the maximum number of colors in an edge coloring of [Formula: see text] that does not have any rainbow copy of any graph in [Formula: see text]. In this paper, we consider the anti-Ramsey number for matchings in regular bipartite graphs and determine its value under several conditions.
APA, Harvard, Vancouver, ISO, and other styles
13

Soukup, Lajos. "Indestructible colourings and rainbow Ramsey theorems." Fundamenta Mathematicae 202, no. 2 (2009): 161–80. http://dx.doi.org/10.4064/fm202-2-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
14

Lu, Linyuan, and Zhiyu Wang. "Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees." SIAM Journal on Discrete Mathematics 34, no. 4 (2020): 2346–62. http://dx.doi.org/10.1137/19m1299876.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Hajnal, András. "Rainbow Ramsey theorems for colorings establishing negative partition relations." Fundamenta Mathematicae 198, no. 3 (2008): 255–62. http://dx.doi.org/10.4064/fm198-3-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
16

Jungic, V., J. Licht, M. Mahdian, J. Nesetril, and R. Radoicic. "Rainbow Arithmetic Progressions and Anti-Ramsey Results." Combinatorics, Probability and Computing 12, no. 5-6 (2003): 599–620. http://dx.doi.org/10.1017/s096354830300587x.

Full text
Abstract:
The van der Waerden theorem in Ramsey theory states that, for every k and t and sufficiently large N, every k-colouring of [N] contains a monochromatic arithmetic progression of length t. Motivated by this result, Radoičić conjectured that every equinumerous 3-colouring of [3n] contains a 3-term rainbow arithmetic progression, i.e., an arithmetic progression whose terms are coloured with distinct colours. In this paper, we prove that every 3-colouring of the set of natural numbers for which each colour class has density more than 1/6, contains a 3-term rainbow arithmetic progression. We also p
APA, Harvard, Vancouver, ISO, and other styles
17

Yousifi, Noorya. "A short proof of anti-Ramsey number for cycles." International Journal of Multidisciplinary Research and Growth Evaluation 2, no. 3 (2021): 108–9. http://dx.doi.org/10.54660/.ijmrge.2021.2.3.108-109.

Full text
Abstract:
Ramsey's theorem states that there exists a least positive integer R(r, s) for which every blue-red edge colouring of the complete graph on R(r, s) vertices contains a blue clique on r vertices or a red clique on s vertices. This work contains a simplified proof of Anti-Ramsey theorem for cycles. If there is an edge e between H and H0, incident to, say, some v ∈ H of color from NEWc(v), then we can make H and H0 connected by adding the edge e and deleting some edge incident to v of the same color as e in H, so the resulting graph G˜ has a connected component of order ≥ 2( k+1/2 ), which contra
APA, Harvard, Vancouver, ISO, and other styles
18

Jin, Zemin. "A heuristic algorithm for rainbow matchings and its application in rainbow Ramsey number for matchings." Discrete Applied Mathematics 368 (June 2025): 153–61. https://doi.org/10.1016/j.dam.2025.02.040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Conidis, Chris J., and Theodore A. Slaman. "Random reals, the rainbow Ramsey theorem, and arithmetic conservation." Journal of Symbolic Logic 78, no. 1 (2013): 195–206. http://dx.doi.org/10.2178/jsl.7801130.

Full text
Abstract:
AbstractWe investigate the question “To what extent can random reals be used as a tool to establish number theoretic facts?” Let 2-RAN be the principle that for every real X there is a real R which is 2-random relative to X. In Section 2, we observe that the arguments of Csima and Mileti [3] can be implemented in the base theory RCA0 and so RCA0 + 2-RAN implies the Rainbow Ramsey Theorem. In Section 3, we show that the Rainbow Ramsey Theorem is not conservative over RCA0 for arithmetic sentences. Thus, from the Csima–Mileti fact that the existence of random reals has infinitary-combinatorial c
APA, Harvard, Vancouver, ISO, and other styles
20

Lu, Linyuan, Andrew Meier, and Zhiyu Wang. "Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs." SIAM Journal on Discrete Mathematics 37, no. 2 (2023): 1162–72. http://dx.doi.org/10.1137/21m1428121.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Wei, Meiqin, Changxiang He, Yaping Mao, and Xiangqian Zhou. "Gallai-Ramsey numbers for rainbow P5 and monochromatic fans or wheels." Discrete Mathematics 345, no. 11 (2022): 113092. http://dx.doi.org/10.1016/j.disc.2022.113092.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Abraham, Uri, James Cummings, and Clifford Smyth. "Some results in polychromatic Ramsey theory." Journal of Symbolic Logic 72, no. 3 (2007): 865–96. http://dx.doi.org/10.2178/jsl/1191333845.

Full text
Abstract:
Classical Ramsey theory (at least in its simplest form) is concerned with problems of the following kind: given a set X and a colouring of the set [X]n of unordered n-tuples from X, find a subset Y ⊆ X such that all elements of [Y]n get the same colour. Subsets with this property are called monochromatic or homogeneous, and a typical positive result in Ramsey theory has the form that when X is large enough and the number of colours is small enough we can expect to find reasonably large monochromatic sets.Polychromatic Ramsey theory is concerned with a “dual” problem, in which we are given a co
APA, Harvard, Vancouver, ISO, and other styles
23

Li, Luyi, Xueliang Li, and Yuan Si. "Gallai–Ramsey numbers for 3-uniform rainbow Berge triangles and monochromatic linear paths or cycles." Discrete Applied Mathematics 344 (February 2024): 81–87. http://dx.doi.org/10.1016/j.dam.2023.11.022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Chen, Hong-Bin, Yen-Jen Cheng, Wei-Tian Li, and Chia-An Liu. "The Boolean Rainbow Ramsey Number of Antichains, Boolean Posets and Chains." Electronic Journal of Combinatorics 27, no. 4 (2020). http://dx.doi.org/10.37236/9034.

Full text
Abstract:
Motivated by the paper, Boolean lattices: Ramsey properties and embeddings Order, 34 (2) (2017), of Axenovich and Walzer, we study the Ramsey-type problems on the Boolean lattices. Given posets $P$ and $Q$, we look for the smallest Boolean lattice $\mathcal{B}_N$ such that any coloring of elements of $\mathcal{B}_N$ must contain a monochromatic $P$ or a rainbow $Q$ as an induced subposet. This number $N$ is called the Boolean rainbow Ramsey number of $P$ and $Q$ in the paper.
 Particularly, we determine the exact values of the Boolean rainbow Ramsey number for $P$ and $Q$ being the antich
APA, Harvard, Vancouver, ISO, and other styles
25

Jin, Zemin, and Xueliang Li. "Anti-Ramsey Numbers for Graphs with Independent Cycles." Electronic Journal of Combinatorics 16, no. 1 (2009). http://dx.doi.org/10.37236/174.

Full text
Abstract:
An edge-colored graph is called rainbow if all the colors on its edges are distinct. Let ${\cal G}$ be a family of graphs. The anti-Ramsey number $AR(n,{\cal G})$ for ${\cal G}$, introduced by Erdős et al., is the maximum number of colors in an edge coloring of $K_n$ that has no rainbow copy of any graph in ${\cal G}$. In this paper, we determine the anti-Ramsey number $AR(n,\Omega_2)$, where $\Omega_2$ denotes the family of graphs that contain two independent cycles.
APA, Harvard, Vancouver, ISO, and other styles
26

"Gallai-Ramsey Number for Rainbow S3." Discrete Mathematics Letters 10 (May 14, 2022): 45–50. http://dx.doi.org/10.47443/dml.2022.033.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Araujo, Igor, and Dadong Peng. "On the Off-Diagonal Unordered Erdős-Rado Numbers." Electronic Journal of Combinatorics 32, no. 2 (2025). https://doi.org/10.37236/13420.

Full text
Abstract:
Erdős and Rado [Journal of the London Mathematical Society 25 (1950)] introduced the Canonical Ramsey numbers $\text{er}(t)$ as the minimum number $n$ such that every edge-coloring of the ordered complete graph $K_n$ contains either a monochromatic, rainbow, upper lexical, or lower lexical clique of order $t$. Richer [Journal of Combinatorial Theory Series B 80 (2000)] introduced the unordered asymmetric version of the Canonical Ramsey numbers $\text{CR}(s,r)$ as the minimum $n$ such that every edge-coloring of the (unordered) complete graph $K_n$ contains either a rainbow clique of order $r$,
APA, Harvard, Vancouver, ISO, and other styles
28

Chang, Fei-Huang, Dániel Gerbner, Wei-Tian Li, et al. "Rainbow Ramsey Problems for the Boolean Lattice." Order, December 11, 2021. http://dx.doi.org/10.1007/s11083-021-09581-4.

Full text
Abstract:
AbstractWe address the following rainbow Ramsey problem: For posets P, Q what is the smallest number n such that any coloring of the elements of the Boolean lattice Bn either admits a monochromatic copy of P or a rainbow copy of Q. We consider both weak and strong (non-induced and induced) versions of this problem.
APA, Harvard, Vancouver, ISO, and other styles
29

Zou, Jinyu, Zhao Wang, Hong-Jian Lai, and Yaping Mao. "Gallai–Ramsey Numbers Involving a Rainbow 4-Path." Graphs and Combinatorics 39, no. 3 (2023). http://dx.doi.org/10.1007/s00373-023-02648-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Liu, Xizhi, and Jialei Song. "Hypergraph Anti‐Ramsey Theorems." Journal of Graph Theory, December 8, 2024. https://doi.org/10.1002/jgt.23204.

Full text
Abstract:
ABSTRACTThe anti‐Ramsey number of an ‐graph is the minimum number of colors needed to color the complete ‐vertex ‐graph to ensure the existence of a rainbow copy of . We establish a removal‐type result for the anti‐Ramsey problem of when is the expansion of a hypergraph with a smaller uniformity. We present two applications of this result. First, we refine the general bound proved by Erdős–Simonovits–Sós, where denotes the family of ‐graphs obtained from by removing one edge. Second, we determine the exact value of for large in cases where is the expansion of a specific class of graphs. This e
APA, Harvard, Vancouver, ISO, and other styles
31

Li, Xihe, and Ligong Wang. "Gallai-Ramsey numbers for rainbow S^{+}_{3} and monochromatic paths." Discussiones Mathematicae Graph Theory, 2020. http://dx.doi.org/10.7151/dmgt.2310.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Wu, Fangfang, Hajo Broersma, Shenggui Zhang, and Binlong Li. "Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs." Journal of Graph Theory, August 9, 2023. http://dx.doi.org/10.1002/jgt.23019.

Full text
Abstract:
AbstractWe present new sharp sufficient conditions for the existence of properly colored and rainbow 's in edge‐colored graphs. Our first results deal with sharp color neighborhood conditions for the existence of properly colored 's in edge‐colored complete graphs and complete bipartite graphs, respectively. Next, we characterize the extremal graphs for an anti‐Ramsey number result due to Alon on the existence of rainbow 's in edge‐colored complete graphs. We also generalize Alon's result from complete to general edge‐colored graphs. Finally, we derive a structural property regarding the extre
APA, Harvard, Vancouver, ISO, and other styles
33

Li, Luyi, Xueliang Li, Yaping Mao, and Yuan Si. "Gallai-Ramsey numbers for rainbow trees and monochromatic complete bipartite graphs." Discussiones Mathematicae Graph Theory, 2024. http://dx.doi.org/10.7151/dmgt.2555.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Jungić, Veselin, Tomáš Kaiser, and Daniel Král'. "A Note on Edge-Colourings Avoiding Rainbow $K_4$ and Monochromatic $K_m$." Electronic Journal of Combinatorics 16, no. 1 (2009). http://dx.doi.org/10.37236/257.

Full text
Abstract:
We study the mixed Ramsey number $maxR(n,{K_m},{K_r})$, defined as the maximum number of colours in an edge-colouring of the complete graph $K_n$, such that $K_n$ has no monochromatic complete subgraph on $m$ vertices and no rainbow complete subgraph on $r$ vertices. Improving an upper bound of Axenovich and Iverson, we show that $maxR(n,{K_m},{K_4}) \leq n^{3/2}\sqrt{2m}$ for all $m\geq 3$. Further, we discuss a possible way to improve their lower bound on $maxR(n,{K_4},{K_4})$ based on incidence graphs of finite projective planes.
APA, Harvard, Vancouver, ISO, and other styles
35

Si, Yuan. "Gallai–Ramsey numbers for rainbow trees and monochromatic double stars or books." Indian Journal of Pure and Applied Mathematics, January 17, 2025. https://doi.org/10.1007/s13226-025-00747-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Axenovich, Maria, and Ryan Martin. "Avoiding Rainbow Induced Subgraphs in Vertex-Colorings." Electronic Journal of Combinatorics 15, no. 1 (2008). http://dx.doi.org/10.37236/736.

Full text
Abstract:
For a fixed graph $H$ on $k$ vertices, and a graph $G$ on at least $k$ vertices, we write $G\longrightarrow H$ if in any vertex-coloring of $G$ with $k$ colors, there is an induced subgraph isomorphic to $H$ whose vertices have distinct colors. In other words, if $G\longrightarrow H$ then a totally multicolored induced copy of $H$ is unavoidable in any vertex-coloring of $G$ with $k$ colors. In this paper, we show that, with a few notable exceptions, for any graph $H$ on $k$ vertices and for any graph $G$ which is not isomorphic to $H$, $G\not\!\!\longrightarrow H$. We explicitly describe all
APA, Harvard, Vancouver, ISO, and other styles
37

Deng, Jinghua, Jianfeng Hou, Xizhi Liu, and Caihong Yang. "Tight Bounds for Rainbow Partial F $F$‐Tiling in Edge‐Colored Complete Hypergraphs." Journal of Graph Theory, July 23, 2025. https://doi.org/10.1002/jgt.23282.

Full text
Abstract:
ABSTRACTFor an ‐graph and integers satisfying , let denote the minimum integer such that every edge‐coloring of using colors contains a rainbow copy of , where is the ‐graphs consisting of vertex‐disjoint copies of . The case is the classical anti‐Ramsey problem proposed by Erdős–Simonovits–Sós [1]. When is a single edge, this becomes the rainbow matching problem introduced by Schiermeyer [2] and Özkahya–Young [3]. We conduct a systematic study of for the case when is much smaller than . Our first main result provides a reduction of to when is bounded and smooth, two properties satisfied by mo
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!