30 citations · 208 across the 26 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011★ 28 cited
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Josef Cibulka, Jan Kyncl
The VC-dimension of a family P of n-permutations is the largest integer k such that the set of restrictions of the permutations in P on some k-tuple of positions is the set of all…
cs.DM2011★ 8 cited
Universal Sets for Straight-Line Embeddings of Bicolored Graphs
Josef Cibulka, Jan Kyncl, Viola Mészáros +2
A set S of n points is 2-color universal for a graph G on n vertices if for every proper 2-coloring of G and for every 2-coloring of S with the same sizes of color classes as G has…