5 research outputs found
Matching random colored points with rectangles
Let S Âż [0, 1]2 be a set of n points, randomly and uniformly selected. Let R Âż B be a random partition, or coloring, of S in which each point of S is included in R uniformly at random with probability 1/2. We study the random number M(n) of points of S that are covered by the rectangles of a maximum strong matching of S with axis-aligned rectangles. The matching consists of closed rectangles that cover exactly two points of S of the same color. A matching is strong if all its rectangles are pairwise disjoint. We prove that almost surely M(n) = 0.83 n for n large enough. Our approach is based on modeling a deterministic greedy matching algorithm, that runs over the random point set, as a Markov chain.Postprint (published version
Topological drawings of complete bipartite graphs
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. We consider a natural class of simple topological drawings of complete bipartite graphs, in which we require that one side of the vertex set bipartition lies on the outer boundary of the drawing. We investigate the combinatorics of such drawings. For this purpose, we define combinatorial encodings of the drawings by enumerating the distinct drawings of subgraphs isomorphic to K2,2 and K3,2, and investigate the constraints they must satisfy. We prove in particular that for complete bipartite graphs of the form K2,n and K3,n, such an encoding corresponds to a drawing if and only if it obeys consistency conditions on triples and quadruples. In the general case of Kk,n with k â„ 2, we completely characterize and enumerate drawings in which the order of the edges around each vertex is the same for vertices on the same side of the bipartition.SCOPUS: cp.kinfo:eu-repo/semantics/publishe
The state of UK housing
Full report `The state of UK housing: a fact file on dwelling conditions' by Leather et al held at q97/08982SIGLEAvailable from British Library Document Supply Centre-DSC:4335.1423(209) / BLDSC - British Library Document Supply CentreGBUnited Kingdo