Liviu Ilinca

most citedOn the Number of 2-SAT Functions

6 citations · 7 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2012

Asymptotics of the Upper Matching Conjecture

Liviu Ilinca, Jeff Kahn

We give upper bounds for the number $Φ_{ℓ} (G)$ of matchings of size $ℓ$ in (i) bipartite graphs $G = (X \cup Y, E)$ with specified degrees $d_{x}$ ( $x \in X$ ), 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★ 6 cited

On the Number of 2-SAT Functions

Liviu Ilinca, Jeff Kahn

We give an alternative proof of a conjecture of Bollobás, Brightwell and Leader, first proved by Peter Allen, stating that the number of boolean functions definable by 2-SAT formul…

math.CO2010

The number of 3-SAT functions

Liviu Ilinca, Jeff Kahn

With $G_{k} (n)$ the number of functions of $n$ boolean variables definable by $k$ -SAT formulae, we prove that $G_{3} (n)$ is asymptotic to $2^{n + (3 n)}$ . This is a strong form of…