scholarly journals Borel liftings of graph limits

2016 ◽  
Vol 21 (0) ◽  
Author(s):  
Peter Orbanz ◽  
Balazs Szegedy
Keyword(s):  
2016 ◽  
Vol 84 (4) ◽  
pp. 386-407 ◽  
Author(s):  
Svante Janson ◽  
Andrew J. Uzzell
Keyword(s):  

2016 ◽  
Vol 26 (4) ◽  
pp. 2193-2210
Author(s):  
Siva Athreya ◽  
Adrian Röllin

10.37236/4266 ◽  
2014 ◽  
Vol 21 (3) ◽  
Author(s):  
Svante Janson ◽  
Andrew J. Uzzell

Given a graph property $\mathcal{P}$, it is interesting to determine the typical structure of graphs that satisfy $\mathcal{P}$.  In this paper, we consider monotone properties, that is, properties that are closed under taking subgraphs.  Using results from the theory of graph limits, we show that if $\mathcal{P}$ is a monotone property and $r$ is the largest integer for which every $r$-colorable graph satisfies $\mathcal{P}$, then almost every graph with $\mathcal{P}$ is close to being a balanced $r$-partite graph.


2018 ◽  
Vol 55 (1) ◽  
pp. 125-152 ◽  
Author(s):  
Michael Drmota ◽  
Emma Yu Jin ◽  
Benedikt Stufler
Keyword(s):  

2012 ◽  
Vol 8 (3) ◽  
pp. 187-231 ◽  
Author(s):  
Béla Bollobás ◽  
Svante Janson ◽  
Oliver Riordan
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document