9 articles
Aubrey William Ingleton
Aubrey William Ingleton (1920–2000) was a British mathematician at Oxford known for the Ingleton inequality, a matroid rank inequality later used in information theory and network coding.
Choe Seok-jeong
Choe Seok-jeong (최석정, 1646–1715) was a Korean mathematician and politician who served as Yeonguijeong, chief state councillor of Joseon Korea, and described orthogonal Latin squares before Euler.
Haim Hanani
Haim Hanani (1912–1991) was an Israeli mathematician born in Poland, known for the Hanani–Tutte theorem and combinatorial design theory, who served as the first rector of the University of the Negev.
Herbert John Ryser
Herbert John Ryser was a mathematician and professor at Caltech from 1967 until his death in 1985, a major figure in combinatorics known for the Bruck–Ryser–Chowla theorem.
Jeff Dinitz
Jeff Dinitz, also known as Jeffrey H. Dinitz, is a mathematician at the University of Vermont known for the Dinitz conjecture, proved by Fred Galvin, and co-editor of the CRC Handbook of Combinatorial Designs.
Johan Jacob Seidel
Johan Jacob Seidel (1919–2001) was a Dutch mathematician who founded the mathematics department of TU Eindhoven and was known for Seidel matrices, switching, and strongly regular graphs.
Nathan Mendelsohn
Nathan Saul Mendelsohn (1917–2006) was a Brooklyn-born Canadian mathematician who spent 57 years at the University of Manitoba and gave his name to the Mendelsohn triple system.
Sharadchandra Shankar Shrikhande
Sharadchandra Shankar Shrikhande (1917–2020) was an Indian mathematician who, with Raj Chandra Bose and E. T. Parker, disproved Euler's 1782 conjecture on orthogonal Latin squares and gave his name to the Shrikhande graph.
Zsolt Baranyai
Zsolt Baranyai is the combinatorialist behind Baranyai's theorem, published in 1975, which settled Sylvester's conjecture by proving complete uniform hypergraphs are 1-factorable whenever k divides n.