Article
Licensed
Unlicensed
Requires Authentication
On estimation of the number of graphs in some hereditary classes
-
V. A. Zamaraev
Published/Copyright:
November 15, 2011
Abstract
We consider the classes in the zero layer of the set of infinite hereditary classes of graphs defined by two forbidden subgraphs. One of these subgraphs is K1,s + Op and the other is Kq. We give an upper bound for the number of graphs in these classes.
Received: 2009-12-23
Published Online: 2011-11-15
Published in Print: 2011-November
© de Gruyter 2011
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Some nonequiprobable models of random permutations
- Automaton representation of a free group
- On estimation of the number of graphs in some hereditary classes
- An asymptotic upper bound for the chromatic index of random hypergraphs
- On stability of the gradient algorithm in convex discrete optimisation problems and related questions
- Rings over which all modules are completely integrally closed
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
Articles in the same Issue
- Some nonequiprobable models of random permutations
- Automaton representation of a free group
- On estimation of the number of graphs in some hereditary classes
- An asymptotic upper bound for the chromatic index of random hypergraphs
- On stability of the gradient algorithm in convex discrete optimisation problems and related questions
- Rings over which all modules are completely integrally closed
- Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
