… If d is a collection of sets, we say that d is nearly-disjoint if !A (qA'] =< 1 for distinct A, A'E~¢.
We begin by describing a conjecture of Erdts, Faber and Lov~sz (see for example [2]), which …

… if that vertex is contained in one of the edges of that packing. We are particularly interested
in packings which cover almost all of the vertices. For a positive real ", we call a packing "-…

… way we analyze the properties of all large vertex-sets (by, eg, focusing on bipartite subgraphs,
… Theorem 4 will be the main tool for establishing our main packing result Theorem 1. Let us …

It is shown that the chromatic index of a nearly-disjoint hypergraph on n vertices is at most n
+ o(n). This is an approximate version of the well-known conjecture of Erdős, Faber, and …

… As above, a collection of sets is a packing—or is nearly-disjoint; we will find it convenient to
… a t-packing is a packing of size t. As usual a matching is a collection of pairwise disjoint sets …

… In Section 2 we use some simple packing … to nearly disjoint, nearly equal-size disks is
straightforward. We impose a regular m-by-m grid on each disk; let G denote the resulting set of O(…

We present a new event-driven molecular dynamics (MD) algorithm for measuring the free
energy of nearly jammed packings of spherical and non-spherical hard particles. This …

… division and apoptosis, partitions into nearly disjoint sets composed principally of the core
and … However, the packing of cells in the interior in our simulations is qualitatively different and …

… Motzkin originally used this to give a new proof of the de Bruijn-Erd6s theorem [2], which
is (1.10) when H is intersecting and nearly-disjoint and p = q _= 1, and our proof may be …

… As above, a collection of sets is a packing—or is nearly-disjoint; we will find it convenient to
… a t-packing is a packing of size t. As usual a matching is a collection of pairwise disjoint sets …