Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture-Reference-Cited by-同舟云学术

Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture

Published:2014-10 Issue:4 Volume:50 Page:340-349
ISSN:0032-9460
Container-title:Problems of Information Transmission
language:en
Short-container-title:Probl Inf Transm

Author:

Blinovsky V. M.

Publisher

Pleiades Publishing Ltd

Subject

Computer Networks and Communications,Computer Science Applications,Information Systems

Link

http://link.springer.com/content/pdf/10.1134/S0032946014040048.pdf

Reference12 articles.

1. Ahlswede, R. and Khachatrian, L., Cone Dependence—A Basic Combinatorial Concept, Des. Codes Cryptogr., 2003, vol. 29, no. 1–3, pp. 29–40.

2. Aydinian, H. and Blinovsky, V.M., A Remark on the Problem of Nonnegative k-Subset Sums, Probl. Peredachi Inf., 2012, vol. 48, no. 4, pp. 56–61 [Probl. Inf. Trans. (Engl. Transl.), 2012, vol. 48, no. 4, pp. 347–351].

3. Bier, T., A Distribution Invariant for Association Schemes and Strongly Regular Graphs, Linear Algebra Appl., 1984, vol. 57, pp. 105–113.

4. Bier, T. and Manickam, N., The First Distribution Invariant of the Johnson-Scheme, Southeast Asian Bull. Math., 1987, vol. 11, no. 1–2, pp. 61–68.

5. Colloq. Math. Soc. János Bolyai;N Manickam,1988

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Number of Nonnegative Sums for Certain Function;Bulletin of the Malaysian Mathematical Sciences Society;2018-08-14

2. The maximum number of subset divisors of a given size;Discrete Mathematics;2016-06

3. Fractional matchings in hypergraphs;Problems of Information Transmission;2015-01