当前位置:
X-MOL 学术
›
Graphs Comb.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Combinatorial Proof of Fisher’s Inequality
Graphs and Combinatorics ( IF 0.7 ) Pub Date : 2020-06-27 , DOI: 10.1007/s00373-020-02205-5 Rogers Mathew , Tapas Kumar Mishra
中文翻译:
Fisher不等式的组合证明
更新日期:2020-06-27
Graphs and Combinatorics ( IF 0.7 ) Pub Date : 2020-06-27 , DOI: 10.1007/s00373-020-02205-5 Rogers Mathew , Tapas Kumar Mishra
In this note, we give a simple, counting based proof of Fisher’s Inequality that does not use any tools from linear algebra.
中文翻译:
Fisher不等式的组合证明
在本说明中,我们给出了一个简单的基于计数的Fisher不等式证明,该证明不使用线性代数的任何工具。