V. Blinovsky

activity

20122019

most citedAsymptotic enumeration of sparse uniform hypergraphs with given degrees

16 citations · 32 across the 19 of their papers we have counts for

collaborators

Showing 2014 · math.COShow all

2 papers · 2 filters

math.CO2014

Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees

Vladimir Blinovsky, Catherine Greenhill

A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n \geq 3$ ,…

math.CO2014

Erdös's Matching Conjecture and $s$ -wise $t$ -intersection Conjecture via Symmetrical Smoothing Method

Vladimir Blinovsky

We find the formula for the maximal cardinality of the family of $n$ -tuples from $(k [ n ])$ with does not have $ℓ$ --matching. This formula after some analytical issues can…

Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees

Erdös's Matching Conjecture and s-wise t-intersection Conjecture via Symmetrical Smoothing Method

Erdös's Matching Conjecture and $s$ -wise $t$ -intersection Conjecture via Symmetrical Smoothing Method