Transference for the Erdős-Ko-Rado theorem

J. Balogh, B. Bollobas, B. Narayanan

Forum of Mathematics, Sigma 3, 18 (2015)

#graphtheory#combinatorics#randomgraphs

Download the PDF

LQ placeholderTwo constructions for an intersecting family of r-sets.

Two constructions for an intersecting family of r-sets.

For natural numbers, the Kneser graph K(n,r) is the graph on the family of r -element subsets of {1,...,n} in which two sets are adjacent if and only if they are disjoint. Delete the edges of K(n,r) with some probability, independently of each other: is the independence number of this random graph equal to the independence number of the Kneser graph itself? We shall answer this question affirmatively as long as r/n is bounded away from 1/2, even when the probability of retaining an edge of the Kneser graph is quite small. This gives us a random analogue of the Erdős–Ko–Rado theorem, since an independent set in the Kneser graph is the same as a uniform intersecting family. To prove our main result, we give some new estimates for the number of disjoint pairs in a family in terms of its distance from an intersecting family; these might be of independent interest.

LQ placeholder

Degree-correlations in a bursting dynamic network model

F. Vanni, P. Barucca

Journal of Economic Interaction and Coordination

LQ placeholder

Scale of non-locality for a system of n particles

S. Talaganis, I. Teimouri

Sub. to Physical Review D

LQ placeholder

How much can we influence the rate of innovation?

T. Fink, M. Reeves

Science Advances

LQ placeholder

The statistical physics of real-world networks

G. Cimini, T. Squartini, F. Saracco, D. Garlaschelli, A. Gabrielli, G. Caldarelli

Nature Reviews Physics

LQ placeholder

PopRank: Ranking pages’ impact and users’ engagement on Facebook

A. Zaccaria, M. Vicario, W. Quattrociocchi, A. Scala, L. Pietronero

PLoS ONE

LQ placeholder

On defining the Hamiltonian beyond quantum theory

D. Branford, O. Dahlsten, A. Garner

Foundations of Physics

120 / 120 papers