A Combinatorial Proof of Fisher’s Inequality
Mathew, Rogers and Mishra, Tapas Kumar (2020) A Combinatorial Proof of Fisher’s Inequality. Graphs and Combinatorics, 36 (6). pp. 1953-1956. ISSN 0911-0119
Full text not available from this repository. (Request a copy)Abstract
In this note, we give a simple, counting based proof of Fisher’s Inequality that does not use any tools from linear algebra. © 2020, Springer Japan KK, part of Springer Nature.
IITH Creators: |
|
||||
---|---|---|---|---|---|
Item Type: | Article | ||||
Additional Information: | The first author was supported by a grant from the Science and Engineering Research Board, Department of Science and Technology, Govt. of India (project number: MTR/2019/000550). | ||||
Uncontrolled Keywords: | Block design; Extremal set theory; Intersecting families | ||||
Subjects: | Computer science | ||||
Divisions: | Department of Computer Science & Engineering | ||||
Depositing User: | . LibTrainee 2021 | ||||
Date Deposited: | 20 Oct 2022 14:12 | ||||
Last Modified: | 20 Oct 2022 14:12 | ||||
URI: | http://raiithold.iith.ac.in/id/eprint/11015 | ||||
Publisher URL: | http://doi.org/10.1007/s00373-020-02205-5 | ||||
OA policy: | https://v2.sherpa.ac.uk/id/publication/17365 | ||||
Related URLs: |
Actions (login required)
View Item |
Statistics for this ePrint Item |
Altmetric