Ramon I. Garcia

activity

20212026

collaborators

5 papers

math.CO2026

Even smaller universal posets

József Balogh, Ramon I. Garcia, Marcelo Sales

We show that for every $η > 0$ and sufficiently large $n$ , there exists a poset of size $2^{(1 + η) n /2}$ containing all the $n$ -element posets as induced subposets. This improves a rec…

math.CO2025

Infinitely many groups exhibiting intermediate growth in maximal sum-free sets

József Balogh, Ramon I. Garcia, Hong Liu +1

Given an Abelian groups $G$ , denote $μ (G)$ the size of its largest sum-free subset and $f_{m a x} (G)$ the number of maximal sum-free sets in $G$ . Confirming a prediction by Liu and…

math.CO2025

Maximal independent sets in the middle two layers of the Boolean lattice

József Balogh, Ce Chen, Ramon I. Garcia

Let $B (2 d - 1, d)$ be the subgraph of the hypercube $Q_{2 d - 1}$ induced by its two largest layers. Duffus, Frankl and Rödl proposed the problem of finding the asymptotics fo…

math.CO2024

On the number of $P$ -free set systems for tree posets $P$

József Balogh, Ramon I. Garcia, Michael C. Wigal

We say a finite poset $P$ is a tree poset if its Hasse diagram is a tree. Let $k$ be the length of the largest chain contained in $P$ . We show that when $P$ is a fixed tree poset,…

math.CO2021

On the number of sum-free triplets of sets

Igor Araujo, József Balogh, Ramon I. Garcia

We count the ordered sum-free triplets of subsets in the group $Z / p Z$ , i.e., the triplets $(A, B, C)$ of sets $A, B, C \subset Z / p Z$ for which the e…

Even smaller universal posets

Infinitely many groups exhibiting intermediate growth in maximal sum-free sets

Maximal independent sets in the middle two layers of the Boolean lattice

On the number of P-free set systems for tree posets P

On the number of sum-free triplets of sets

On the number of $P$ -free set systems for tree posets $P$