AbstractGiven a property P of graphs, write Pnfor the set of graphs with vertex set [ n ] having property P. We call | Pn| the speed of P. Recent research has shown that the speed of a monotone or hereditary property P can be a constant, polynomial, or exponential function of n, and the structure of the graphs in P can then be well described. Similarly, | Pn| can be of the form n(1−1/k+o(1))nor 2(1−1/k+o(1))n2/2for some positive integer k> 1 and the properties can be described and have well-behaved speeds. In this paper, we discuss the behavior of properties with speeds between these latter bounds, i.e., between n(1+o(1))nand 2(1/2+o(1))n2/2
A hereditary property of graphs is a collection of graphs which is closed under taking induced subgr...
For a graph property X, let X(n) be the number of graphs with vertex set {1, ..., n} having property...
The paper [J. Balogh, B. Bollobás, D. Weinreich, J. Combin. Theory Ser. B, 95 (2005), pp. 29--48] id...
AbstractGiven a property P of graphs, write Pnfor the set of graphs with vertex set [ n ] having pro...
Given a property sript P sign of graphs, write sript P signn for the set of graphs with vertex set [...
AbstractGiven a property P of graphs, write Pn for the set of graphs with vertex set [n] having prop...
Given a property P of graphs, write P n for the set of graphs with vertex set [n] having property P....
AbstractA hereditary graph property is a collection of labeled graphs, closed under isomorphism and ...
AbstractGiven a monotone property P of graphs, write Pn for the set of graphs with vertex set [n] ha...
AbstractA hereditary property of graphs is a collection of graphs which is closed under taking induc...
AbstractA hereditary property of graphs is a collection of graphs which is closed under taking induc...
A property of graphs is a collection P of graphs closed under isomorphism; we call P hereditary if i...
AbstractA hereditary graph property is a collection of labeled graphs, closed under isomorphism and ...
AbstractA property of graphs is a collection P of graphs closed under isomorphism; we call P heredit...
AbstractA property of graphs is a collection P of graphs closed under isomorphism; we call P heredit...
A hereditary property of graphs is a collection of graphs which is closed under taking induced subgr...
For a graph property X, let X(n) be the number of graphs with vertex set {1, ..., n} having property...
The paper [J. Balogh, B. Bollobás, D. Weinreich, J. Combin. Theory Ser. B, 95 (2005), pp. 29--48] id...
AbstractGiven a property P of graphs, write Pnfor the set of graphs with vertex set [ n ] having pro...
Given a property sript P sign of graphs, write sript P signn for the set of graphs with vertex set [...
AbstractGiven a property P of graphs, write Pn for the set of graphs with vertex set [n] having prop...
Given a property P of graphs, write P n for the set of graphs with vertex set [n] having property P....
AbstractA hereditary graph property is a collection of labeled graphs, closed under isomorphism and ...
AbstractGiven a monotone property P of graphs, write Pn for the set of graphs with vertex set [n] ha...
AbstractA hereditary property of graphs is a collection of graphs which is closed under taking induc...
AbstractA hereditary property of graphs is a collection of graphs which is closed under taking induc...
A property of graphs is a collection P of graphs closed under isomorphism; we call P hereditary if i...
AbstractA hereditary graph property is a collection of labeled graphs, closed under isomorphism and ...
AbstractA property of graphs is a collection P of graphs closed under isomorphism; we call P heredit...
AbstractA property of graphs is a collection P of graphs closed under isomorphism; we call P heredit...
A hereditary property of graphs is a collection of graphs which is closed under taking induced subgr...
For a graph property X, let X(n) be the number of graphs with vertex set {1, ..., n} having property...
The paper [J. Balogh, B. Bollobás, D. Weinreich, J. Combin. Theory Ser. B, 95 (2005), pp. 29--48] id...