On the Typical Structure of Graphs in a Monotone Property
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.
2013 ◽
Vol 22
(5)
◽
pp. 749-762
◽
Keyword(s):
Keyword(s):
2012 ◽
Vol 268-270
◽
pp. 845-850
Keyword(s):
2010 ◽
Vol 10
(21)
◽
pp. 10639-10654
◽
Keyword(s):
Keyword(s):
2014 ◽
Vol 955-959
◽
pp. 419-422
Keyword(s):