Article
Licensed
Unlicensed
Requires Authentication
The number of components in a random bipartite graph
-
A. I. SALTYKOV
Published/Copyright:
October 9, 2009
Published Online: 2009-10-09
Published in Print: 1995
Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- The number of components in a random bipartite graph
- Chromatic uniqueness of K4-homeomorphs
- The spectra of undirected de Bruijn graphs and an upper bound for their independence numbers
- Orthogonal starters and Kirkman multidimensional hypercubes
- New inequality relations between depth and delay
- Algorithms of computing determinants in commutative rings
- On equations with subgroup restrictions on solutions in free groups
- Associators, commutators and linearity of a quasigroup
- Similarity of involutory matrices over a local ring of characteristic 2k
- On checking tests for a parity counter
- Ravines of functions and non-uniformity of their epigraphs
Articles in the same Issue
- The number of components in a random bipartite graph
- Chromatic uniqueness of K4-homeomorphs
- The spectra of undirected de Bruijn graphs and an upper bound for their independence numbers
- Orthogonal starters and Kirkman multidimensional hypercubes
- New inequality relations between depth and delay
- Algorithms of computing determinants in commutative rings
- On equations with subgroup restrictions on solutions in free groups
- Associators, commutators and linearity of a quasigroup
- Similarity of involutory matrices over a local ring of characteristic 2k
- On checking tests for a parity counter
- Ravines of functions and non-uniformity of their epigraphs