263 search results - page 34 / 53 » ejc 2007 |
EJC
2010
14 years 9 months ago
2010
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
EJC
2010
14 years 9 months ago
2010
In [11] all locally subquadrangular hyperplanes of finite symplectic and Hermitian dual polar spaces were determined with the aid of counting arguments and divisibility properties...
EJC
2010
14 years 9 months ago
2010
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to th...
EJC
2006
14 years 9 months ago
2006
The digraphs P(n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, K...
EJC
2006
14 years 9 months ago
2006
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...