1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2012
Asymptotics of the Upper Matching Conjecture
Liviu Ilinca, Jeff Kahn
We give upper bounds for the number of matchings of size in (i) bipartite graphs with specified degrees (), and (ii) general graph…
math.CO2012★ 1 cited
Counting maximal antichains and independent sets
Liviu Ilinca, Jeff Kahn
Answering several questions of Duffus, Frankl and Rödl, we give asymptotics for the logarithms of (i) the number of maximal antichains in the n-dimensional Boolean algebra and (ii)…
math.CO2010
The number of 3-SAT functions
Liviu Ilinca, Jeff Kahn
With the number of functions of boolean variables definable by -SAT formulae, we prove that is asymptotic to . This is a strong form of…