The Ramsey number of diamond-matchings and loose cycles in hypergraphs.
Gyárfás, András, Sárközy, Gábor N., Szemerédi, Endre (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “A linear upper bound in zero-sum Ramsey theory.”
The Ramsey number of diamond-matchings and loose cycles in hypergraphs.
On a theorem of Erdős, Rubin, and Taylor on choosability of complete bipartite graphs.
Kostochka, Alexandr (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An improvement to Mathon's cyclotomic Ramsey colorings.
Xu, Xiaodong, Radziszowski, Stanislaw P. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rainbow -factors of complete -uniform -partite hypergraphs.
Chen, Ailian, Zhang, Fuji, Li, Hao (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph.
Axenovich, Maria, Choi, JiHyeok (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Generalizing the Ramsey problem through diameter.
Mubayi, Dhruv (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On chromatic and achromatic numbers of uniform hypergraphs
Ernest Jucovič, František Olejník (1974)
Časopis pro pěstování matematiky
Similarity:
Vertex-distinguishing edge-colorings of linear forests
Sylwia Cichacz, Jakub Przybyło (2010)
Discussiones Mathematicae Graph Theory
Similarity:
In the PhD thesis by Burris (Memphis (1993)), a conjecture was made concerning the number of colors c(G) required to edge-color a simple graph G so that no two distinct vertices are incident to the same multiset of colors. We find the exact value of c(G) - the irregular coloring number, and hence verify the conjecture when G is a vertex-disjoint union of paths. We also investigate the point-distinguishing chromatic index, χ₀(G), where sets, instead of multisets, are required to be distinct,...
Rainbow matching in edge-colored graphs.
LeSaulnier, Timothy D., Stocker, Christopher, Wenger, Paul S., West, Douglas B. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Almost-Rainbow Edge-Colorings of Some Small Subgraphs
Elliot Krop, Irina Krop (2013)
Discussiones Mathematicae Graph Theory
Similarity:
Let f(n, p, q) be the minimum number of colors necessary to color the edges of Kn so that every Kp is at least q-colored. We improve current bounds on these nearly “anti-Ramsey” numbers, first studied by Erdös and Gyárfás. We show that [...] , slightly improving the bound of Axenovich. We make small improvements on bounds of Erdös and Gyárfás by showing [...] and for all even n ≢ 1(mod 3), f(n, 4, 5) ≤ n− 1. For a complete bipartite graph G= Kn,n, we show an n-color construction to color...
Constructive lower bounds on classical multicolor Ramsey numbers.
Xu, Xiaodong, Xie, Zheng, Exoo, Geoffrey, Radziszowski, Stanisław P. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A decomposition of gallai multigraphs
Alexander Halperin, Colton Magnant, Kyle Pula (2014)
Discussiones Mathematicae Graph Theory
Similarity:
An edge-colored cycle is rainbow if its edges are colored with distinct colors. A Gallai (multi)graph is a simple, complete, edge-colored (multi)graph lacking rainbow triangles. As has been previously shown for Gallai graphs, we show that Gallai multigraphs admit a simple iterative construction. We then use this structure to prove Ramsey-type results within Gallai colorings. Moreover, we show that Gallai multigraphs give rise to a surprising and highly structured decomposition into directed...