Article
Licensed
Unlicensed
Requires Authentication
An asymptotic upper bound for the chromatic index of random hypergraphs
-
Yu. A. Budnikov
Published/Copyright:
November 15, 2011
Abstract
We give an asymptotic upper bound for the chromatic index of a random hypergraph in the case where the edge length of the hypergraph is an increasing function of the number of vertices of the hypergraph.
Received: 2010-02-12
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
