1. On the girth and diameter of generalized Johnson graphs
2. Chemical graphs. XIII. Combinatorial patterns;Balaban A. T.;Rev. Roumain Math. Pures Appl.,1972
3. Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
4. Zs. Baranyai . 1975 . On the factorization of the complete uniform hypergraph. In Infinite and finite sets (Colloq ., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday) , Vol. I . North-Holland, Amsterdam, 91–108. Colloq. Math. Soc. János Bolyai , Vol. 10. Zs. Baranyai. 1975. On the factorization of the complete uniform hypergraph. In Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdős on his 60th birthday), Vol. I. North-Holland, Amsterdam, 91–108. Colloq. Math. Soc. János Bolyai, Vol. 10.
5. Short proof that Kneser graphs are Hamiltonian for n ⩾ 4k