39 citations · 111 across the 33 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015★ 4 cited
Intersecting -free families
Dániel Gerbner, Abhishek Methuku, Casey Tompkins
We study the problem of determining the size of the largest intersecting -free family for a given partially ordered set (poset) . In particular, we find the exact size of the…
math.CO2015
De Bruijn-Erdős type theorems for graphs and posets
Pierre Aboulker, Guillaume Lagarde, David Malec +2
A classical theorem of De Bruijn and Erdős asserts that any noncollinear set of n points in the plane determines at least n distinct lines. We prove that an analogue of this theore…