Set-systems with restricted multiple intersections.

Grolmusz, Vince

Displaying similar documents to “Set-systems with restricted multiple intersections.”

Guessing secrets.

Chung, Fan, Graham, Ronald, Leighton, Tom (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

A paintability version of the combinatorial Nullstellensatz, and list colorings of $k$ -partite $k$ -uniform hypergraphs.

Schauz, Uwe (2010)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Bicoloring Steiner triple systems.

Colbourn, Charles J., Dinitz, Jeffrey H., Rosa, Alexander (1999)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

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:

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...