The following pages link to Aeryung Moon (Q762176):
Displaying 6 items.
- The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\) (Q762177) (← links)
- An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q) (Q1163019) (← links)
- An embedding theorem for affine resolvable designs (Q1165245) (← links)
- Characterization of the odd graphs \(O_ k \)by parameters (Q1168984) (← links)
- Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k) (Q1836676) (← links)
- On the uniqueness of the graphs G(n,k) of the Johnson schemes (Q1836677) (← links)
