The Ramsey number.
Boza, Luis (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Necklace bisection with one cut less than needed.”
The Ramsey number.
Clusters in a multigraph with elevated density.
Goldberg, Mark K. (2007)
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:
Monochromatic and zero-sum sets of nondecreasing modified diameter.
Grynkiewicz, David, Sabar, Rasheed (2006)
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:
Generalizing the Ramsey problem through diameter.
Mubayi, Dhruv (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On edge colorings with at least colors in every subset of vertices.
Sárközy, Gábor N., Selkow, Stanley (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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:
Multicoloured Hamilton cycles.
Albert, Michael, Frieze, Alan, Reed, Bruce (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A paintability version of the combinatorial Nullstellensatz, and list colorings of -partite -uniform hypergraphs.
Schauz, Uwe (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the maximum average degree and the incidence chromatic number of a graph.
Hosseini Dolama, Mohammad, Sopena, Eric (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
A ramsey-type theorem for multiple disjoint copies of induced subgraphs
Tomoki Nakamigawa (2014)
Discussiones Mathematicae Graph Theory
Similarity:
Let k and ℓ be positive integers with ℓ ≤ k − 2. It is proved that there exists a positive integer c depending on k and ℓ such that every graph of order (2k−1−ℓ/k)n+c contains n vertex disjoint induced subgraphs, where these subgraphs are isomorphic to each other and they are isomorphic to one of four graphs: (1) a clique of order k, (2) an independent set of order k, (3) the join of a clique of order ℓ and an independent set of order k − ℓ, or (4) the union of an independent set of...