Aeryung Moon - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 6 from 6

1984

The graphs ::::G::::(::::n::::, ::::k::::) of the Johnson Schemes are unique for ::::n:::: geq 20Aeryung Moon. JCT, 37(2):173-188, 1984. [doi]

1982

An Analogue of the Erdös-Ko-Rado Theorem for the Hamming Schemes H(n, q)Aeryung Moon. JCT, 32(3):386-390, 1982.

Characterization of the graphs of the Johnson schemes ::::G::::(3::::k::::, ::::k::::) and ::::G::::(3::::k:::: + 1, ::::k::::)Aeryung Moon. JCT, 33(3):213-221, 1982. [doi]

On the uniqueness of the graphs ::::G::::(::::n::::, ::::k::::) of the Johnson schemesAeryung Moon. JCT, 33(3):256-264, 1982. [doi]

An embedding theorem for affine resolvable designsAeryung Moon. DM, 40(2-3):255-259, 1982. [doi]

Characterization of the odd graphs O::k:: by parametersAeryung Moon. DM, 42(1):91-97, 1982. [doi]

Sign in or sign up to see more results.

runs on WebDSL