70
Voted
EJC
2006
15 years 20 days ago
2006
117
Voted
EJC
2006
15 years 20 days ago
2006
Let g(n, r) be the maximum possible cardinality of a family F of subsets of {1, 2, . . . , n} so that given a union of at most r members of F, one can identify at least one of the...
EJC
2006
15 years 20 days 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...
95
Voted
EJC
2006
15 years 20 days ago
2006
We show how to obtain all nonassociative Moufang loops of order less than 64 and 4262 nonassociative Moufang loops of order 64 in a unified way. We conjecture that there are no oth...
71
Voted
EJC
2006
15 years 20 days ago
2006
85
Voted
EJC
2006
15 years 20 days ago
2006
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
63
Voted
EJC
2006
15 years 20 days ago
2006
As a generalization of Deza graphs, we introduce Deza digraphs and describe the basic theory of these graphs. We also prove the necessary and sufficient conditions when a weakly d...
84
Voted
EJC
2006
15 years 20 days ago
2006
It is known that a graded lattice of rank n is supersolvable if and only if it has an EL-labelling where the labels along any maximal chain are exactly the numbers 1, 2, . . . , n ...
74
Voted
EJC
2006
15 years 20 days ago
2006
70
Voted
EJC
2006
15 years 20 days ago
2006
A class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphism to H. We give a general necessary and sufficient condition for the existence of boun...