4 citations · 22 across the 30 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
math.MG2012
Separating families of convex sets
D. Gerbner, G. Tóth
Two elements, and , are separated by a set if it contains exactly one of and . We prove that any set of points in general position in the plane can be separat…
math.CO2012★ 2 cited
2-Colored Matchings in a 3-Colored K^{3}_{12}
Neal Bushaw, Peter Csorba, Lindsay Erickson +5
Let denote the complete -uniform hypergraph on vertices. A matching in a hypergraph is a set of pairwise vertex disjoint edges. Recent Ramsey-type results re…