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:
Displaying similar documents to “New lower bound formulas for multicolored Ramsey numbers.”
Constructive lower bounds on classical multicolor Ramsey numbers.
An improvement to Mathon's cyclotomic Ramsey colorings.
Xu, Xiaodong, Radziszowski, Stanislaw P. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Two color off-diagonal Rado-type numbers.
Myers, Kellen, Robertson, Aaron (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Some new Ramsey colorings.
Exoo, Geoffrey (1998)
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:
Rainbow Ramsey theory.
Jungić, Veselin, Nešetřil, Jaroslav, Radoičić, Radoš (2005)
Integers
Similarity:
New lower bounds for some multicolored Ramsey numbers.
Robertson, Aaron (1999)
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:
Further results on the achromatic number
Dennis Geller, Hudson Kronk (1974)
Fundamenta Mathematicae
Similarity:
Discrepancy of symmetric products of hypergraphs.
Doerr, Benjamin, Gnewuch, Michael, Hebbinghaus, Nils (2006)
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...
Semi-definite positive programming relaxations for graph K-coloring in frequency assignment
Philippe Meurdesoif, Benoît Rottembourg (2001)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper we will describe a new class of coloring problems, arising from military frequency assignment, where we want to minimize the number of distinct -uples of colors used to color a given set of -complete-subgraphs of a graph. We will propose two relaxations based on Semi-Definite Programming models for graph and hypergraph coloring, to approximate those (generally) NP-hard problems, as well as a generalization of the works of Karger et al. for hypergraph coloring, to find...