The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n - 2
Discrete & Computational Geometry
Journal of Combinatorial Theory Series A
New asymptotics for bipartite Tura´n numbers
Journal of Combinatorial Theory Series A
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Helly-type theorems and geometric transversals
Handbook of discrete and computational geometry
Bipartite Ramsey numbers and Zarankiewicz numbers
Discrete Mathematics
On neighbors in geometric permutations
Discrete Mathematics
Excluded permutation matrices and the Stanley-Wilf conjecture
Journal of Combinatorial Theory Series A
Geometric Permutations Induced by Line Transversals through a Fixed Point
Discrete & Computational Geometry
Extremal graphs with bounded densities of small subgraphs
Journal of Graph Theory
Geometric permutations of disjoint unit spheres
Computational Geometry: Theory and Applications
Improvement on the decay of crossing numbers
GD'07 Proceedings of the 15th international conference on Graph drawing
Improved Bounds for Geometric Permutations
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Let F be a family of permutations on [n]={1,...,n} and let Y={y"1,...,y"m}@?[n], with y"1