Clusters in a multigraph with elevated density.
Goldberg, Mark K. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On edge colorings with at least colors in every subset of vertices.”
Clusters in a multigraph with elevated density.
On colorings avoiding a rainbow cycle and a fixed monochromatic subgraph.
Axenovich, Maria, Choi, JiHyeok (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The Ramsey number.
Boza, Luis (2011)
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:
Equitable hypergraph orientations.
Caro, Yair, West, Douglas, Yuster, Raphael (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Fans and bundles in the graph of pairwise sums and products.
Halbeisen, Lorenz (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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:
Rainbow -factors of complete -uniform -partite hypergraphs.
Chen, Ailian, Zhang, Fuji, Li, Hao (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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:
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...
Multicoloured Hamilton cycles.
Albert, Michael, Frieze, Alan, Reed, Bruce (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Distinguishing chromatic numbers of bipartite graphs.
Laflamme, C., Seyffarth, K. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Short certificates for tournaments.
Alon, Noga, Ruszinkó, Miklós (1997)
The Electronic Journal of Combinatorics [electronic only]
Similarity: