16 citations · 32 across the 19 of their papers we have counts for
8 papers · 1 filter
Fractional matching in hypergraphs
Vladimir Blinovsky
We find the exact formula for the minimal number of edges of hypergraph which guaranteed fractional matching of cardinality in the case when is integer.
Minimal Number of Edges in Hypergraph Guaranteeing Perfect Fractional Matching and MMS Conjecture
Vladimir Blinovsky
We prove Ahlswede- Khachatrian conjecture. From this conjecture follows of several other conjectures including Manickam-Miklós-Singhi conjecture.
Complete intersection theorem and complete nontrivial-intersection theorem for systems of set partitions
Vladimir Blinovsky
We prove the complete intersection theorem and complete nontrivial-intersection theorem for systems of set partitions
Asymptotic enumeration of sparse uniform hypergraphs with given degrees
Vladimir Blinovsky, Catherine Greenhill
Let be a fixed integer. For infinitely many , let be a vector of nonnegative integers such that their sum is divisible by . W…
Proof of two conjectures on correlation inequalities for one class of monotone functions
Vladimir Blinovsky
We prove two conjectures on correlation inequalities for functions that are linear combinations of unimodal Boolean monotone nondecreasing functions
One conjecture about size of Sidon sets
Vladimir Blinovsky
We prove that maximal cardinality of the Sidon set from exceeds $\sqrt{n}
Correlation Inequality for Formal Series
Vladimir Blinovsky
We prove two correlation inequalities .
The solution of the complete nontrivial cycle intersection problem for permutations
Vladimir Blinovsky, Llohann D. Sperança
We prove the Complete nontrivial cycle-intersection theorem for systems of permutations.