Generalizing the Ramsey problem through diameter.
Mubayi, Dhruv (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mubayi, Dhruv (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axenovich, Maria, Choi, JiHyeok (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fujita, Shinya, Kaneko, Atsushi, Schiermeyer, Ingo, Suzuki, Kazuhiro (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Xu, Xiaodong, Radziszowski, Stanislaw P. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Xu, Xiaodong, Xie, Zheng, Exoo, Geoffrey, Radziszowski, Stanisław P. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dzido, Tomasz, Nowik, Andrzej, Szuca, Piotr (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...
LeSaulnier, Timothy D., Stocker, Christopher, Wenger, Paul S., West, Douglas B. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ward, C., Szabó, S. (1994)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Eric Andrews, Futaba Fujie, Kyle Kolasinski, Chira Lumduanhom, Adam Yusko (2014)
Discussiones Mathematicae Graph Theory
Similarity:
In a red-blue coloring of a nonempty graph, every edge is colored red or blue. If the resulting edge-colored graph contains a nonempty subgraph G without isolated vertices every edge of which is colored the same, then G is said to be monochromatic. For two nonempty graphs G and H without isolated vertices, the mono- chromatic Ramsey number mr(G,H) of G and H is the minimum integer n such that every red-blue coloring of Kn results in a monochromatic G or a monochromatic H. Thus, the standard...
Tomasz Dzido, Renata Zakrzewska (2006)
Discussiones Mathematicae Graph Theory
Similarity:
The upper domination Ramsey number u(m,n) is the smallest integer p such that every 2-coloring of the edges of Kₚ with color red and blue, Γ(B) ≥ m or Γ(R) ≥ n, where B and R is the subgraph of Kₚ induced by blue and red edges, respectively; Γ(G) is the maximum cardinality of a minimal dominating set of a graph G. In this paper, we show that u(4,4) ≤ 15.
Ghebleh, Mohammad, Kral', Daniel, Norine, Serguei, Thomas, Robin (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Yuster, Raphael (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity: