Christopher Bouchard

works on

combinatorial optimization 1 extremal set theory 1 k-chains 1 supersaturation 1 union-closed families 1

From the 1 of 4 linked papers with an AI index.

collaborators

4 papers

math.CO2026

Supersaturation in union-closed families of sets

Christopher Bouchard

The paper proves that for a union‑closed family of subsets of [n] with a given size, the number of k‑chains is smallest when the family consists of the largest possible sets, and t…

math.CO2025

An upper bound for union-closed family size

Christopher Bouchard

Let $A$ be a union-closed family of sets with universe $⋃_{A \in A} A = [n] = {1, \dots, n}$ and length $ℓ$ . We prove that $|\mathcal{A}| \leq \sum_{i=…

math.CO2025

An averaging result for union-closed families of sets

Christopher Bouchard

Let $A$ be a union-closed family of sets with base set $b (A) = ⋃_{A \in A} A$ denoted by $[n] = {1, \dots, n}$ , and for any real $x > 0$ , let $\math…

math.CO2025

On the lattice formulation of the union-closed sets conjecture

Christopher Bouchard

The union-closed sets conjecture, also known as Frankl's conjecture, is a well-studied problem with various formulations. In terms of lattices, the conjecture states that every fin…