activity
20212026
most citedIntersecting families of sets are typically trivial

1 citations · 1 across the 5 of their papers we have counts for

collaborators

7 papers

math.CO2026

Counting hypergraphs without linear cycles of fixed length

József Balogh, Ramon I. Garcia, Abhishek Methuku

Let be the -uniform linear cycle on hyperedges. An -graph is -free if it contains no copy of . Let $\operatorname{ex}_{r}(n,C_{k}^…

math.CO2026

Even smaller universal posets

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

We show that for every and sufficiently large , there exists a poset of size containing all the -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 , denote the size of its largest sum-free subset and the number of maximal sum-free sets in . 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 be the subgraph of the hypercube 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 -free set systems for tree posets

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

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

math.CO2021★ 1 cited

Intersecting families of sets are typically trivial

József Balogh, Ramon I. Garcia, Lina Li +1

A family of subsets of is intersecting if every pair of its sets intersects. Determining the structure of large intersecting families is a central problem in extremal combina…

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 , i.e., the triplets of sets for which the e…