Geometric intersection graphs form an intriguing class of structures in which vertices represent geometric objects – such as line segments, discs, or curves – and an edge is established between two ...

Journal of Applied Probability, Vol. 47, No. 3 (SEPTEMBER 2010), pp. 826-840 (15 pages) A random intersection graph G(n, m, p) is defined on a set 𝓥 of n vertices. There is an auxiliary set 𝓦 ...

At the International Workshop on Combinatorial Image Analysis, held in Brno, Czech Republic, our URGE To Compute team received the Best Student Paper Award for their presentation, "On Intersection ...

In this paper we consider a model for the spread of a stochastic SIR (Susceptible → Infectious → Recovered) epidemic on a network of individuals described by a random intersection graph. Individuals ...

A graph G with vertex set V is said to be n-existentially closed (or n-e.c. for short) if, for every proper subset S of V with |S|=n and every subset T of S, there exists a vertex x in V-S such that x ...

All quadratic functions have the same type of curved graphs with a line of symmetry. The graph of the quadratic function \(y = ax^2 + bx + c\) is a smooth curve with one turning point. The turning ...