More than forty years ago, ErdÅ‘s conjectured that for any t â‰¤ n k , every k-uniform hypergraph on n vertices without t disjoint edges has at most max {( ktâˆ’1 k )

Calcineurin inhibitors (CNI) are metabolized by cytochrome-P4503A (CYP3A) enzymes and extruded into the intestinal lumen by the drug efflux pump, P-glycoprotein (P-gp). The impact of singleâ€¦ (More)

Consider the following random process. At each round, one is presented with two random edges from the edge set of the complete graph on n vertices, and is asked to choose one of them. The selectedâ€¦ (More)

A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two parts differ by at most 1, and its size is the number of edges which go across the two parts. Inâ€¦ (More)

Let PG(q) denote the number of proper q-colorings of a graph G. This function, called the chromatic polynomial of G, was introduced by Birkhoff in 1912, who sought to attack the famous four-colorâ€¦ (More)

Let G be a graph with maximum degree Î” whose vertex set is partitioned into parts V (G) = V1 âˆª Â· Â· Â· âˆª Vr . A transversal is a subset of V (G) containing exactly one vertex from each part Vi . If itâ€¦ (More)

The Internet has emerged as perhaps the most important network in modern computing, but rather miraculously, it was created through the individual actions of a multitude of agents rather than by aâ€¦ (More)