Paths of specified length in random k-partite graphs
Fix positive integers k and l. Consider a random k-partite graph on n vertices obtained by partitioning the vertex set into V i, (i=1, …,k) each having size Ω(n) and choosing each possible edge with probability p. Consider any vertex x in any V i and any vertex y. We show that the expe...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2001-12-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/142 |