A. Hajnal

most citedConflict free colorings of (strongly) almost disjoint set-systems

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.LO2010★ 1 cited

Conflict free colorings of (strongly) almost disjoint set-systems

András Hajnal, István Juhász, Lajos Soukup +1

A set-system $X$ is a $(λ, κ, μ)$ -system iff $∣ X ∣ = λ$ , $∣ x ∣ = κ$ for each $x \in X$ , and $X$ is $μ$ -almost disjoint. We write $[λ, κ, μ] - > ρ$ iff every $(λ, κ, μ)$ -system has a "conflic…

math.LO1998

Strongly almost disjoint families, II

Andras Hajnal, Istvan Juhasz, Saharon Shelah

The relations M(kappa,lambda,mu)->B [resp. B(sigma)] meaning that if A subset [kappa]^lambda with |A|=kappa is mu-almost disjoint then A has property B [resp. has a sigma-transvers…