Polychromatic coloring of tuples in hypergraphs
From MaRDI portal
Cites work
- -nets and simplex range queries
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A combinatorial result about points and balls in Euclidean space
- A combinatorial result on points and circles on the plane
- A constructive proof of the general Lovász local lemma
- A note on the circle containment problem
- A survey of hypergraph Ramsey problems
- Almost tight bounds for -nets
- Applications of random sampling in computational geometry. II
- Approximate polytope membership queries
- Bounded VC-dimension implies a fractional Helly theorem
- Circles through two points that always enclose many points
- Colorful strips
- Coloring Delaunay-edges and their generalizations
- Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
- Coloring points with respect to squares
- Colouring bottomless rectangles and arborescences
- Convex polygons are cover-decomposable
- Cover-decomposition and polychromatic numbers
- Covering the plane with convex polygons
- Decomposition of multiple coverings into many parts
- Decomposition of multiple coverings into more parts
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- Depth of segments and circles through points enclosing many points: A note
- Dominating sets in \(k\)-majority tournaments.
- scientific article; zbMATH DE number 3692179 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- Improved deterministic algorithms for linear programming in low dimensions
- Indecomposable Coverings
- Learnability and the Vapnik-Chervonenkis dimension
- Making Octants Colorful and Related Covering Decomposition Problems
- Making triangles colorful
- More on decomposing coverings by octants
- On a problem of Spencer
- On Center Regions and Balls Containing Many Points
- On the density of families of sets
- Optimally decomposing coverings with translates of a convex polygon
- Polychromatic coloring for half-planes
- Polychromatic colorings of geometric hypergraphs via shallow hitting sets
- Polychromatic colorings of unions of geometric hypergraphs
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning
- Some extremal results on circles containing points
- Survey on decomposition of multiple coverings
- The \(\varepsilon\)-\(t\)-net problem
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- Topological hypergraphs
- Unsplittable coverings in the plane
This page was built for publication: Polychromatic coloring of tuples in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7312659)
