Extremal Values of the Interval Number of a Graph

The interval number $i( G )$ of a simple graph $G$ is the smallest number $t$ such that to each vertex in $G$ there can be assigned a collection of at most $t$ finite closed intervals on the real line so that there is an edge between vertices $v$ and $w$ in $G$ if and only if some interval for $v$ intersects some interval for $w$. The well known interval graphs are precisely those graphs $G$ with $i ( G )\leqq 1$. We prove here that for any graph $G$ with maximum degree $d, i ( G )\leqq \lceil \frac{1}{2} ( d + 1 ) \rceil$. This bound is attained by every regular graph of degree $d$ with no triangles, so is best possible. The degree bound is applied to show that $i ( G )\leqq \lceil \frac{1}{3}n \rceil$ for graphs on $n$ vertices and $i ( G )\leqq \lfloor \sqrt{e} \rfloor$ for graphs with $e$ edges

On singular probability densities generated by extremal dynamics

Extremal dynamics is the mechanism that drives the Bak-Sneppen model into a (self-organized) critical state, marked by a singular stationary probability density $p(x)$. With the aim of understanding this phenomenon, we study the BS model and several variants via mean-field theory and simulation. In all cases, we find that $p(x)$ is singular at one or more points, as a consequence of extremal dynamics. Furthermore we show that the extremal barrier $x_i$ always belongs to the `prohibited' interval, in which $p(x)=0$. Our simulations indicate that the Bak-Sneppen universality class is robust with regard to changes in the updating rule: we find the same value for the exponent $\pi$ for all variants. Mean-field theory, which furnishes an exact description for the model on a complete graph, reproduces the character of the probability distribution found in simulations. For the modified processes mean-field theory takes the form of a functional equation for $p(x)$.Comment: 16 pages, 11 figure

Interval minors of complete bipartite graphs

Interval minors of bipartite graphs were recently introduced by Jacob Fox in the study of Stanley-Wilf limits. We investigate the maximum number of edges in $K_{r,s}$-interval minor free bipartite graphs. We determine exact values when $r=2$ and describe the extremal graphs. For $r=3$, lower and upper bounds are given and the structure of $K_{3,s}$-interval minor free graphs is studied